B. Mike and Fun：题目

太离谱了呀，这啥遍历题啊。。。

#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<int> a((int)6e5);
vector<int> b((int)6e5), c[(int)6e5];
const int mod = 1e9 + 7;
int g[1001][1001];
signed main()
{int n,m,q;cin>>n>>m>>q;for (int i=1;i<=n;i++){for (int j=1;j<=m;j++){cin>>g[i][j];}}for (int i=1;i<=n;i++){int cou = 0;for (int j=1;j<=m;j++){if (g[i][j]==1) cou++;else cou = 0;a[i] = max(a[i],cou);}}int x,y;while (q--){cin>>x>>y;g[x][y] = (g[x][y]+1)%2;int cou = 0;a[x] = 0;for (int i=1;i<=m;i++){if (g[x][i]==1) cou++;else cou = 0;a[x] = max(a[x],cou);}int res = 0;for (int i=1;i<=n;i++) res = max(res,a[i]);cout<<res<<endl;}
}