zoukankan      html  css  js  c++  java
  • B

    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 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
    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列01数,q次询问,每次输入x,y代表(x,y)上的数字1变0,0变1,并输出每一行最长的连续1长度。
    思路:水题,模拟即可。

    #include <bits/stdc++.h>
    
    using namespace std;
    int num[505][505];
    
    int main()
    {
        int n,m,q;
        cin>>n>>m>>q;
        for(int i = 1;i <= n;i++)
        {
            for(int j = 1;j <= m;j++)
            {
                cin>>num[i][j];
            }
        }
    
        for(int i = 1;i <= q;i++)
        {
            int x,y;
            cin>>x>>y;
            num[x][y] = !num[x][y];
            int MAXN = -1;
            for(int k = 1;k <= n;k++)
            {
                int ans = 0;
                for(int j = 1;j <= m;j++)
                {
                    if(num[k][j] == 0)
                        ans = 0;
                    else
                        ans++;
                    MAXN = max(MAXN,ans);
                }
            }
            printf("%d
    ",MAXN);
        }
        return 0;
    }
    
    
  • 相关阅读:
    PHP 学习1- 函数之error_reporting(E_ALL ^ E_NOTICE)详细说明
    ja_charity模板研究
    迭代创建级联目录
    迭代和递归的区别
    递归删除目录
    PHP递归仿DOS的tree命令
    深入理解递归
    wamp默认函数嵌套98层,否则报Fatal error: Maximum function nesting level of '100' reached, aborting!
    静态static方法中调运非静态方法
    微信支付05
  • 原文地址:https://www.cnblogs.com/tomjobs/p/10617594.html
Copyright © 2011-2022 走看看