CodeForces 688A Opponents
2016-08-17 19:51
447 查看
A. Opponents
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Arya has n opponents in the school. Each day he will fight with all opponents who are present this day. His opponents have
some fighting plan that guarantees they will win, but implementing this plan requires presence of them all. That means if one day at least one of Arya's opponents is absent at the school, then Arya will beat all present opponents. Otherwise, if all opponents
are present, then they will beat Arya.
For each opponent Arya knows his schedule — whether or not he is going to present on each particular day. Tell him the maximum number of consecutive days that he will
beat all present opponents.
Note, that if some day there are no opponents present, Arya still considers he beats all the present opponents.
Input
The first line of the input contains two integers n and d (1 ≤ n, d ≤ 100) —
the number of opponents and the number of days, respectively.
The i-th of the following d lines
contains a string of length n consisting of characters '0' and '1'.
The j-th character of this string is '0' if the j-th
opponent is going to be absent on the i-th day.
Output
Print the only integer — the maximum number of consecutive days that Arya will beat all present opponents.
Examples
input
output
input
output
input
output
Note
In the first and the second samples, Arya will beat all present opponents each of the d days.
In the third sample, Arya will beat his opponents on days 1, 3 and 4 and
his opponents will beat him on days 2 and 5. Thus, the maximum
number of consecutive winning days is 2, which happens on days 3 and 4.
题意:Arya在学校有n个对手,如果这些对手在一天全部出现,那么Arya将被打败,否则Arya会赢,给出d天对手是否出现的情况(字符0表示不出现,1表示出现)
问Arya最多可以连续几天赢。
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Arya has n opponents in the school. Each day he will fight with all opponents who are present this day. His opponents have
some fighting plan that guarantees they will win, but implementing this plan requires presence of them all. That means if one day at least one of Arya's opponents is absent at the school, then Arya will beat all present opponents. Otherwise, if all opponents
are present, then they will beat Arya.
For each opponent Arya knows his schedule — whether or not he is going to present on each particular day. Tell him the maximum number of consecutive days that he will
beat all present opponents.
Note, that if some day there are no opponents present, Arya still considers he beats all the present opponents.
Input
The first line of the input contains two integers n and d (1 ≤ n, d ≤ 100) —
the number of opponents and the number of days, respectively.
The i-th of the following d lines
contains a string of length n consisting of characters '0' and '1'.
The j-th character of this string is '0' if the j-th
opponent is going to be absent on the i-th day.
Output
Print the only integer — the maximum number of consecutive days that Arya will beat all present opponents.
Examples
input
2 2 10 00
output
2
input
4 1 0100
output
1
input
4 5
110111110110
10111111
output
2
Note
In the first and the second samples, Arya will beat all present opponents each of the d days.
In the third sample, Arya will beat his opponents on days 1, 3 and 4 and
his opponents will beat him on days 2 and 5. Thus, the maximum
number of consecutive winning days is 2, which happens on days 3 and 4.
题意:Arya在学校有n个对手,如果这些对手在一天全部出现,那么Arya将被打败,否则Arya会赢,给出d天对手是否出现的情况(字符0表示不出现,1表示出现)
问Arya最多可以连续几天赢。
#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; int main() { int n,d,i,j,k,l,flag; char a;//本来以为只有0和1,用整数就行,结果一直没输出。。。然后换做字符就行了。 while(scanf("%d%d",&n,&d)!=EOF) { int l=0; int Maxx=0; for(i=1;i<=d;i++) { flag=0; for(j=1;j<=n;j++) { cin>>a; if(a=='0') flag=1; } if(flag==1) l++; else l=0; Maxx=max(Maxx,l); } printf("%d\n",Maxx); } return 0; }
相关文章推荐
- CodeForces 688A Opponents (水题)
- codeforces 688A Opponents
- Codeforces-688A Opponents
- CodeForces 688A Opponents(群架)
- codeforces 167B Wizards and Huge Prize 概率dp
- codeforces 628D 数位dp
- Codeforces 500B New Year Permutation
- 【codeforces 778C】 Peterson Polyglot
- Codeforces 385C Bear and Prime Numbers【巧妙用埃筛】
- Codeforces 543 B. World Tour
- codeforces--510C--Fox And Names
- 【CodeForces】A. Helpful Maths
- codeforces 703D
- Codeforces 779C-Dishonest Sellers
- codeforces 839D (推公式+容斥原理/莫比乌斯函数)
- codeforces 913 A Modular Exponentiation
- codeforces 509 B题 Painting Pebbles
- CodeForces 547E Mike and Friends [Fail树+树状数组]
- Codeforces-546D Soldier and Number Game 【质因子分解+打表+DP】
- CodeForces - 777C Alyona and Spreadsheet (vector存储二维数组)