zoukankan      html  css  js  c++  java
  • Mike and Fun

    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 integers nm 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
    Copy
    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
    Copy
    3
    4
    3
    3
    4

     还是一道模拟

    #include <iostream>
    #include <vector>
    #include <algorithm>
    #include <string>
    #include <set>
    #include <queue>
    #include <map>
    #include <sstream>
    #include <cstdio>
    #include <cstring>
    #include <numeric>
    #include <cmath>
    #include <unordered_set>
    #include <unordered_map>
    //#include <xfunctional>
    #define ll long long
    #define mod 1000000007
    using namespace std;
    int dir[4][2] = { { 0,1 },{ 0,-1 },{ -1,0 },{ 1,0 } };
    const long long INF = 0x7f7f7f7f7f7f7f7f;
    const int inf = 0x3f3f3f3f;
    
    int main()
    {
        int n, m, q;
        cin >> n >> m >> q;
        vector<vector<int>> v(n + 1, vector<int> (m + 1,0));
        vector<int> vmax(n + 1, 0);
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= m; j++)
                cin >> v[i][j];
        int maxn=0;
        for (int i = 1; i <= n; i++)
        {
            int t = 0;
            for (int j = 1; j <= m; j++)
            {
                if (v[i][j] == 1 && v[i][j - 1] == 1)
                {
                    t++;
                }
                else if (v[i][j] == 1 && v[i][j - 1] == 0)
                {
                    t = 1;
                }
                else
                {
                    t = 0;
                }
                maxn = max(maxn, t);
                vmax[i] = maxn;
            }
            maxn = 0;
        }
        while (q--)
        {
            int x, y;
            cin >> x >> y;
            v[x][y]=v[x][y] == 0 ? 1 : 0;
            int t = 0,maxt=0;
            for (int j = 1; j <= m; j++)
            {
                if (v[x][j] == 1 && v[x][j - 1] == 1)
                {
                    t++;
                }
                else if (v[x][j] == 1 && v[x][j - 1] == 0)
                {
                    t = 1;
                }
                else
                {
                    t = 0;
                }
                maxt = max(maxt, t);
            }
            vmax[x] = maxt;
            int res=*max_element(vmax.begin(),vmax.end());
            cout << res<<endl;
        }
        return 0;
    }
  • 相关阅读:
    Eureka与ZooKeeper 的比较(转)
    springcloud 与分布式系统(转载)
    jvm 分代回收算法通俗理解
    关于JVM调优
    Java常用的数据结构
    mysql数据库引擎(转载)
    java的堆栈通俗理解
    ArrayList 的实现原理
    hashMap 源码解读理解实现原理和hash冲突
    Sklearn库例子——决策树分类
  • 原文地址:https://www.cnblogs.com/dealer/p/12443107.html
Copyright © 2011-2022 走看看