zoukankan      html  css  js  c++  java
  • Codeforces Round #305 (Div. 2)——B.——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.

    Sample test(s)
    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

     大意:被consecutive坑了...

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    int a[510][510];
    int main()
    {
        int n,m,q;
        int b[510];
        int x,max2;
        scanf("%d%d%d",&n,&m,&q);
        for(int i = 1; i <= n ;i++){
            x = 0;
             max2 = 0;
            for(int j = 1; j <= m; j++){
                scanf("%d",&a[i][j]);
                if(a[i][j] == 0){
                    max2 = max(max2,x);
                    x = 0;
                }
                else x++;
            }
            max2 = max(max2,x);
                b[i] = max2;
        }
        int c,r;
        for(int i = 1; i <= q; i++){
            scanf("%d%d",&c,&r);
            if(a[c][r] == 1){
                a[c][r] = 0;
            }
            else {
                a[c][r] = 1;
            }
       // printf("%d %d %d %d
    ",a[1][1],a[1][2],a[1][3],a[1][4]);
           /* for(int i = 1; i <= n ;i++){
                for(int j = 1; j <= m ;j++)
                    printf("%d ",a[i][j]);
                puts("");
            }
            */
            int max1 = 0;
                x = 0;
                max2 = 0;
                for(int j =1; j <= m; j++){
                    if(a[c][j] == 0){
                        max2 =max(max2,x);
                        x = 0;
                    }
                    else x++;
                }
                max2 = max(max2,x);
                b[c] = max2;
                for(int i = 1; i <= n ;i++)
                    max1 = max(max1,b[i]);
            printf("%d
    ",max1);
        }
        return 0;
    }
            
    

      

  • 相关阅读:
    python assert断言函数
    Python中错误之 TypeError: object() takes no parameters、TypeError: this constructor takes no arguments
    python 3.5构建WINDOWS推送服务
    Python调用(运行)外部程序
    sqlalchemy相关知识
    利用rabbit_mq队列消息实现对一组主机进行命令下发
    Centos 下安装Zabbix Linux 客户端
    Lynis 2.2.0 :面向Linux系统的安全审查和扫描工具
    防暴力破解 Fail2Ban之python
    linux服务器被攻击处理过程
  • 原文地址:https://www.cnblogs.com/zero-begin/p/4533740.html
Copyright © 2011-2022 走看看