CodeForces 548B Mike and Fun

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<deque>
#include<functional>
#include<iterator>
#include<vector>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#define CPY(A, B) memcpy(A, B, sizeof(A))
typedef long long LL;
typedef unsigned long long uLL;
const int MOD = int (1e9) + 7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const double OO = 1e20;
const double PI = acos (-1.0);
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
int bb[510][510];
int main() {
    int n,m,q,f,g,maxn,en;
    scanf ("%d%d%d",&n,&m,&q);
    for (int i=1; i<=n; i++) {
        for (int j=1; j<=m; j++) {
            scanf ("%d",&bb[i][j]);
        }
    }
    while (q--) {
        scanf ("%d%d",&f,&g);
        if (bb[f][g]) {bb[f][g]=0;}
        else { bb[f][g]=1; }
        maxn=0;
        for (int i=1; i<=n; i++) {
            en=0;
            for (int j=1; j<=m; j++) {
                if (bb[i][j]) { ++en; }
                else { en=0; }/**/
                maxn=max (en,maxn);/**/
            }
        }
        printf ("%d\n",maxn);
    }
    return 0;
}