Codeforces Round #305 (Div. 2) B

Description

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.

$\text{[math]}$

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 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.

Output

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

Examples

input

output

求每次更改连续1的最长长度，我们可以只记录发生更改的一行，然后遍历所有行就好。

（不过貌似可以每次都遍历一次也能AC，不过我超时了）

#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
 
    int n,m,t;
    int mp[510][510];
   // int maxn=-1;
    int d[510];
    cin>>n>>m>>t;
    for(int i=1; i<=n; i++)
    {
        int num=0;
        int maxn=-1;
        for(int j=1; j<=m; j++)
        {
            cin>>mp[i][j];
        }
        for(int j=1; j<=m; j++)
        {
            if(mp[i][j]==1)
            {
                num++;
                maxn=max(num,maxn);
            }
            else
            {
                maxn=max(num,maxn);
                num=0;
            }
        }
        d[i]=maxn;
       // cout<<d[i]<<endl;
    }
    while(t--)
    {
       // int MAX=-1;
        int x,y;
        cin>>x>>y;
        // mp[x][y]=~mp[x][y];
        if(mp[x][y])
        {
            mp[x][y]=0;
        }
        else
        {
            mp[x][y]=1;
        }
        int sum=0;
        int MAX=-1;
        for(int j=1;j<=m;j++)
        {
            if(mp[x][j])
            {
                sum++;
                MAX=max(sum,MAX);
            }
            else
            {
                MAX=max(sum,MAX);
                sum=0;
            }
        }
        d[x]=MAX;
        int MMAX=-1;
      //  cout<<MAX<<endl;
        for(int i=1;i<=n;i++)
        {
            MMAX=max(MMAX,d[i]);
        }
        cout<<MMAX<<endl;
    }
 
    return 0;
}