Codeforces Round #305 (Div. 2)-Mike and Fun(暴力求解连续1)
来源:互联网 发布:vs源码加密 编辑:程序博客网 时间:2024/05/01 08:56
Mike and some bears are playing a game just for fun. Mike is the judge. All bears except Mike are standing in an n × m grid, there's exactly one bear in each cell. We denote the bear standing in column number j of row number i by (i, j). Mike's hands are on his ears (since he's the judge) and each bear standing in the grid has hands either on his mouth or his eyes.
They play for q rounds. In each round, Mike chooses a bear (i, j) and tells him to change his state i. e. if his hands are on his mouth, then he'll put his hands on his eyes or he'll put his hands on his mouth otherwise. After that, Mike wants to know the score of the bears.
Score of the bears is the maximum over all rows of number of consecutive bears with hands on their eyes in that row.
Since bears are lazy, Mike asked you for help. For each round, tell him the score of these bears after changing the state of a bear selected in that round.
The first line of input contains three integers n, m and q (1 ≤ n, m ≤ 500 and 1 ≤ q ≤ 5000).
The next n lines contain the grid description. There are m integers separated by spaces in each line. Each of these numbers is either 0(for mouth) or 1 (for eyes).
The next q lines contain the information about the rounds. Each of them contains two integers i and j (1 ≤ i ≤ n and 1 ≤ j ≤ m), the row number and the column number of the bear changing his state.
After each round, print the current score of the bears.
5 4 50 1 1 01 0 0 10 1 1 01 0 0 10 0 0 01 11 41 14 24 3
34334
#include <stdio.h>#include <math.h>#include <string.h>#include <stdlib.h>#include <iostream>#include <sstream>#include <algorithm>#include <set>#include <queue>#include <stack>#include <map>using namespace std;typedef long long LL;const int inf=0x3f3f3f3f;const double eps=1e-10;const double pi= acos(-1.0);int a[510][510];int main(){ int n,m,q,i,j; int x,y; int maxx; while(~scanf("%d %d %d",&n,&m,&q)){ for(i=1;i<=n;i++){ for(j=1;j<=m;j++){ scanf("%d",&a[i][j]); } } while(q--){ scanf("%d %d",&x,&y); maxx=-inf; if(a[x][y]==1) a[x][y]=0; else a[x][y]=1; for(i=1;i<=n;i++){ int sum=0; for(j=1;j<=m;j++){ if(a[i][j]==1) sum++; else sum=0; maxx=max(maxx,sum); } } printf("%d\n",maxx); } } return 0;}
- Codeforces Round #305 (Div. 2)-Mike and Fun(暴力求解连续1)
- Codeforces Round #305 (Div. 2) B.Mike and Fun
- Codeforces Round #305 (Div. 2) B. Mike and Fun(水题)
- Codeforces Round #305 (Div. 2)B. Mike and Fun
- Codeforces Round #305 (Div. 2) C. Mike and Frog +B. Mike and Fun
- Codeforces Round #305 (Div. 2) C. Mike and Frog
- Codeforces Round #305 (Div. 2) A. Mike and Fax
- Codeforces Round #305 (Div. 2), problem: (A) Mike and Fax
- Codeforces Round #305 (Div. 2) C. Mike and Frog
- Codeforces Round #305 (Div. 2)--A. Mike and Fax
- Codeforces Round #305 (Div. 2)A. Mike and Fax
- Codeforces Round #305 (Div. 2) 548D - Mike and Feet
- Codeforces Round #305 (Div. 2) D.Mike and Feet
- Codeforces Round #305 (Div. 1)C. Mike and Foam 数学
- Codeforces Round #305 (Div. 1) B. Mike and Feet
- Codeforces Round #361 (Div. 2) A. Mike and Cellphone
- Codeforces Round #361 (Div. 2) B. Mike and Shortcuts
- Codeforces Round #361 (Div. 2) C. Mike and Chocolate Thieves
- 第13周 《C++语言基础》程序阅读——多态性与抽象类 (4)
- 第十三周阅读项目(1):虚函数
- 葛教你如何成为顶尖互联网产品经理
- 指环王经典,励志篇
- InnoDB的三个关键特性
- Codeforces Round #305 (Div. 2)-Mike and Fun(暴力求解连续1)
- 《C Primer Plus(第5版)中文版》第6章编程练习第14题
- poj 3177 边双连通分量(处理重边)
- Java--comparator接口与Comparable接口的区别
- SpringMVC 学习
- Python标准模块logging
- 贪心算法——算法总结(一)
- Linux下简单加密程序实现
- UNIX网络编程(配置unp.h)