Codeforces Round #360 (Div. 2) A Opponents(水题)
2016-07-01 15:54
435 查看
思路:水题,模拟一下就好了
#include<bits\stdc++.h>
using namespace std;
string s[105];
int main()
{
int n,d;
cin >> n >> d;
for(int i = 1;i<=d;i++)
cin >> s[i];
int ans = 0,res = 0;
int flag ;
for(int i = 1;i<=d;i++)
{
flag = 0;
for(int j = 0;j<s[i].size();j++)
if(s[i][j]=='0')
{
flag = 1;
break;
}
if(!flag)
res=0;
if(flag)
res+=1;
ans = max(ans,res);
}
cout << ans << endl;
}
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.
#include<bits\stdc++.h>
using namespace std;
string s[105];
int main()
{
int n,d;
cin >> n >> d;
for(int i = 1;i<=d;i++)
cin >> s[i];
int ans = 0,res = 0;
int flag ;
for(int i = 1;i<=d;i++)
{
flag = 0;
for(int j = 0;j<s[i].size();j++)
if(s[i][j]=='0')
{
flag = 1;
break;
}
if(!flag)
res=0;
if(flag)
res+=1;
ans = max(ans,res);
}
cout << ans << endl;
}
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
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.
相关文章推荐
- linux运维经验总结
- Linux大文件分区
- webx 框架入门一
- SVN报Previous operation has not finished; run 'cleanup' if it was interrupted错误的解决方法
- 获得Linux时间戳
- Linux 下安装openstf
- vmware中的linux虚拟机如何增加磁盘容量
- Linux运维必学必会(一)- sed命令
- 14.6.3 Grouping DML Operations with Transactions 组DML操作
- 14.6.3 Grouping DML Operations with Transactions 组DML操作
- CodeForces 494C Helping People (treedp)
- Linux菜鸟学习笔记(常用基本命令之文件搜索)
- open-falcon的部署流程<1>
- centos 安装 mysql5.6
- 架构师于小波:魅族实时消息推送架构
- Tomcat安全配置
- Linux下的I/O复用与epoll详解(重点)
- Server Tomcat v8.0 Server at localhost failed to start.的解决方法
- 给VMware下的Linux扩展磁盘空间(以CentOS6.3为例)
- 关于@property定义的属性和大括号里定义的属性的区别