Codeforces Round #325 (Div. 2) A
2016-05-12 00:20
453 查看
A. Alena's Schedule
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Alena has successfully passed the entrance exams to the university and is now looking forward to start studying.
One two-hour lesson at the Russian university is traditionally called a pair, it lasts for two academic hours (an academic hour is equal to 45 minutes).
The University works in such a way that every day it holds exactly n lessons. Depending on the schedule of a particular group of students, on a given day, some pairs may actually contain classes, but some may be empty (such pairs are called breaks).
The official website of the university has already published the schedule for tomorrow for Alena's group. Thus, for each of the n pairs she knows if there will be a class at that time or not.
Alena's House is far from the university, so if there are breaks, she doesn't always go home. Alena has time to go home only if the break consists of at least two free pairs in a row, otherwise she waits for the next pair at the university.
Of course, Alena does not want to be sleepy during pairs, so she will sleep as long as possible, and will only come to the first pair that is presented in her schedule. Similarly, if there are no more pairs, then Alena immediately goes home.
Alena appreciates the time spent at home, so she always goes home when it is possible, and returns to the university only at the beginning of the next pair. Help Alena determine for how many pairs she will stay at the university. Note that during some pairs Alena may be at the university waiting for the upcoming pair.
Input
The first line of the input contains a positive integer n (1 ≤ n ≤ 100) — the number of lessons at the university.
The second line contains n numbers ai (0 ≤ ai ≤ 1). Number ai equals 0, if Alena doesn't have the i-th pairs, otherwise it is equal to 1. Numbers a1, a2, ..., an are separated by spaces.
Output
Print a single number — the number of pairs during which Alena stays at the university.
Examples
input
output
input
output
input
output
Note
In the first sample Alena stays at the university from the second to the fifth pair, inclusive, during the third pair she will be it the university waiting for the next pair.
In the last sample Alena doesn't have a single pair, so she spends all the time at home.
题意:从第一个‘1’ 开始计数 两个‘1’中最多有一个‘0’ 直到最后一个‘1’ 统计这个序列的个数
题解:暴力
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Alena has successfully passed the entrance exams to the university and is now looking forward to start studying.
One two-hour lesson at the Russian university is traditionally called a pair, it lasts for two academic hours (an academic hour is equal to 45 minutes).
The University works in such a way that every day it holds exactly n lessons. Depending on the schedule of a particular group of students, on a given day, some pairs may actually contain classes, but some may be empty (such pairs are called breaks).
The official website of the university has already published the schedule for tomorrow for Alena's group. Thus, for each of the n pairs she knows if there will be a class at that time or not.
Alena's House is far from the university, so if there are breaks, she doesn't always go home. Alena has time to go home only if the break consists of at least two free pairs in a row, otherwise she waits for the next pair at the university.
Of course, Alena does not want to be sleepy during pairs, so she will sleep as long as possible, and will only come to the first pair that is presented in her schedule. Similarly, if there are no more pairs, then Alena immediately goes home.
Alena appreciates the time spent at home, so she always goes home when it is possible, and returns to the university only at the beginning of the next pair. Help Alena determine for how many pairs she will stay at the university. Note that during some pairs Alena may be at the university waiting for the upcoming pair.
Input
The first line of the input contains a positive integer n (1 ≤ n ≤ 100) — the number of lessons at the university.
The second line contains n numbers ai (0 ≤ ai ≤ 1). Number ai equals 0, if Alena doesn't have the i-th pairs, otherwise it is equal to 1. Numbers a1, a2, ..., an are separated by spaces.
Output
Print a single number — the number of pairs during which Alena stays at the university.
Examples
input
5 0 1 0 1 1
output
4
input
7 1 0 1 0 0 1 0
output
4
input
1 0
output
0
Note
In the first sample Alena stays at the university from the second to the fifth pair, inclusive, during the third pair she will be it the university waiting for the next pair.
In the last sample Alena doesn't have a single pair, so she spends all the time at home.
题意:从第一个‘1’ 开始计数 两个‘1’中最多有一个‘0’ 直到最后一个‘1’ 统计这个序列的个数
题解:暴力
#include<iostream> #include<cstring> #include<cstdio> using namespace std; int n; int a[105]; int ans; int main() { scanf("%d",&n); ans=0; int f=-100; for(int i=1;i<=n;i++) scanf("%d",&a[i]); for(int i=1;i<=n;i++) { if(a[i]==1&&(i-f-1)==1) ans++; if(a[i]==1) { ans++; f=i; } } cout<<ans<<endl; return 0; }
相关文章推荐
- 7-visual-studio-extension.html
- 这篇文章最初发在CSDN上这篇文章最初发在CSDN上
- 技术培训 | 大数据分析处理与用户画像实践
- Linux操作系统下iptables+nat实现ADSL共享上网!
- 剑指offer-第三题方法总结
- Unreal Engine 4 —— 多线程任务构建
- android TextView去除顶部和底部留白
- linux双网卡NAT共享上网
- SPI协议及其工作原理浅析
- C++作业5-数组选择/字符串/求和
- 申请格式
- leetcode 197. Rising Temperature to_days()
- Failed to start LSB:Bring up/down networking(已解决)
- fdshrehre
- Android入门之网络图片查看器
- 通过包装类实现连接池
- 标准连接池的实现
- 工具类的第二种写法(jdbc中获取连…
- 可以将获得连接对象和关闭资源打包…
- mysql数据库实现CURD操作