问题 AD: 麦克和欢乐
内存限制：256 MB
时间限制：1 S
题面：传统
评测方式：文本比较
上传者：
提交：3
通过：2
题目描述
麦克和几头熊在玩一个好玩的游戏。麦克是裁判。除了麦克所有的熊都站在一个n*m的网格中，一个格子中有一头熊。我们用(i,j)代表站在第j列i行的熊。麦克的手放在它的耳朵上（因为它是裁判），站在网格里的熊的手放在它们的嘴或眼睛上。
它们玩q轮。麦克挑一头熊(I,j)告诉他去改变状态，比方说如果它的手放在嘴上，那么它会把手放在眼上，否则放在嘴上。然后，麦克想知道这些熊的得分。
这些熊的得分是每行连续的手放眼上的熊的数量的最大值。
因为熊很懒，麦克想你求助。告诉他每轮改变状态后熊的得分。
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.
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 integers n, m and q (1≤n,m≤500 and 1≤q≤5000). The next n lines contain the grid desc
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.
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
输入格式
第一行包含三个整型n,m,q(1 <= n, m <= 500 且 1 <= q <= 5000)
之后的n行包含网格的描述，每行有m个整型由空格分隔。0代表手放嘴上，1代表手放眼上。
之后的q行包含各轮的信息。每行包含两个整型i,j(1 <= I <= n 且 1 <= j <= m)，(i,j)上的熊改变状态。
之后的n行包含网格的描述，每行有m个整型由空格分隔。0代表手放嘴上，1代表手放眼上。
之后的q行包含各轮的信息。每行包含两个整型i,j(1 <= I <= n 且 1 <= j <= m)，(i,j)上的熊改变状态。
输出格式
每轮之后，打印当前得分。
输入样例 复制
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输出样例 复制
3
4
3
3
4