zoukankan      html  css  js  c++  java
  • Codeforces Round #305 (Div. 2) B. Mike and Fun 暴力

     

     B. Mike and Fun

    Time Limit: 20 Sec  Memory Limit: 256 MB

    题目连接

    http://codeforces.com/contest/548/problem/A

    Description

    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 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

    Sample Output

    3
    4
    3
    3
    4
     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 
     4 int main() {
     5     int n,m,q,x,y;
     6     int mapp[505][505];
     7     cin>>n>>m>>q;
     8     for(int i = 1; i <= n; i++) {
     9         int total = 0;
    10         int maxx = 0;
    11         for(int j = 1; j <= m; j++) {
    12             scanf("%d",&mapp[i][j]);
    13             if(mapp[i][j] == 0) 
    14                 total = 0;
    15             total += mapp[i][j];
    16             /**更新该行最大的连续值*/ 
    17             if(total > maxx) maxx = total;
    18         }
    19         mapp[i][0] = maxx;    
    20     }
    21     
    22     int total;
    23     while(q--) {
    24         scanf("%d %d",&x,&y);
    25         /**依题意进行处理*/ 
    26         if(mapp[x][y] == 0) {
    27             mapp[x][y] = 1;
    28         } else {
    29             mapp[x][y] = 0;
    30         }
    31         
    32         int maxx = 0;
    33         total = 0;
    34         
    35         /**更新该行最大的连续值*/ 
    36         for(int i = 1; i <= m; i++) {
    37             total += mapp[x][i];
    38             if(total > maxx) maxx = total;
    39             if(mapp[x][i] == 0) total = 0;
    40         }
    41         
    42         /**找最大的连续值*/
    43         mapp[x][0] = maxx; 
    44         int ans = mapp[1][0];
    45         for(int i = 2; i <= n; i++) {
    46             if(mapp[i][0] > ans) ans = mapp[i][0];
    47         }
    48         cout<<ans<<endl;
    49     }
    50     
    51     return 0;
    52 }
  • 相关阅读:
    【第三章】DI的配置使用(一)
    【第二章】IoC的配置使用(一)
    【第二章】IoC的基础与详解(一)
    【第一章】 Spring概述(二)
    【第一章】 Spring概述(一)
    数据库分库分表思路
    Java的内存模型JVM
    Servlet 单例多线程详细解释
    三极管
    续流二极管
  • 原文地址:https://www.cnblogs.com/jj81/p/8893704.html
Copyright © 2011-2022 走看看