[2018-4-20]BNUZ套题比赛div2 B 【补题】



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.

Input

The first line of input contains three integersnm 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 iand j (1 ≤ i ≤ n and 1 ≤ j ≤ m), the row number and the column number of the bear changing his state.

Output

After each round, print the current score of the bears.

Examples
Input
5 4 5
0 1 1 0
1 0 0 1
0 1 1 0
1 0 0 1
0 0 0 0
1 1
1 4
1 1
4 2
4 3
Output
3
4
3
3
4

这道题没时间开了。。。。但是题意还是很简单的,就是一个0和1组成的矩阵,然后给坐标,坐标的值访问一次改变一次,然后输出整个矩阵中的连续的1的最大长度 , 大家都在考虑TLE怎么解决,因为想把答案一起输出,又是存每行最大什么的,结果发现结果可以q询问一次输出一次。。。。。不知道为什么,我的优化版没过,暴力过了。。。。玄学

#include<cstdio>
#include <cstring>
#include<cmath>
#include<iostream> 
using namespace std;

int a[510][510];
int main() {
	int n,m,p;
	int i,j,k;
	int mx=0,cnt=0;
	int x,y;
	scanf("%d%d%d",&n,&m,&p);

	for(i=1; i<=n; i++) {
		for(j=1; j<=m; j++) {
			scanf("%d",&a[i][j]);
		}
	} // input
	for(i=0; i<p; i++) {
		scanf("%d%d",&x,&y);
		if(a[x][y]) {
			a[x][y] = 0;
		} else {
			a[x][y] = 1;
		} //change
		mx=0;
		for( j=1; j<=n; j++) {
			cnt=0;
			for(k=1; k<=m; k++) {
				if(a[j][k] ) {
					cnt++;
				} else {
					cnt=0;
				}
				mx=max(mx,cnt);
			}
		}
		printf("%d\n",mx);
	}
	return 0;
}

展开阅读全文

没有更多推荐了,返回首页