CodeForces 673 A Bear and Game
来源:互联网 发布:藏族怎么看中国知乎 编辑:程序博客网 时间:2024/04/28 16:29
Bear Limak likes watching sports on TV. He is going to watch a game today. The game lasts 90 minutes and there are no breaks.
Each minute can be either interesting or boring. If 15 consecutive minutes are boring then Limak immediately turns TV off.
You know that there will be n interesting minutes t1, t2, ..., tn. Your task is to calculate for how many minutes Limak will watch the game.
The first line of the input contains one integer n (1 ≤ n ≤ 90) — the number of interesting minutes.
The second line contains n integers t1, t2, ..., tn (1 ≤ t1 < t2 < ... tn ≤ 90), given in the increasing order.
Print the number of minutes Limak will watch the game.
37 20 88
35
916 20 30 40 50 60 70 80 90
15
915 20 30 40 50 60 70 80 90
90
In the first sample, minutes 21, 22, ..., 35 are all boring and thus Limak will turn TV off immediately after the 35-th minute. So, he would watch the game for 35 minutes.
In the second sample, the first 15 minutes are boring.
In the third sample, there are no consecutive 15 boring minutes. So, Limak will watch the whole game.
题意: 给出一串数字表示在这90分钟内的精彩时刻,其他时间都为无聊时间。假如无聊时间持续大于15分钟,那么他就会关掉电视。问你他最长能看多长时间的电视。
AC代码:
#include<stdio.h>int main(){int n;int a[100];while(scanf("%d",&n)!=EOF){int falg=0;for(int i=0;i<n;i++) scanf("%d",&a[i]);if(a[0]>15){printf("15\n");continue;} else {for(int i=0;i<n-1;i++){if(a[i+1]-a[i]>15){printf("%d\n",a[i]+15);falg=1;break;}}if(falg!=1){if(90-a[n-1]>15) printf("%d\n",a[n-1]+15);else printf("90\n");}}}return 0; }
- CodeForces 673A Bear and Game
- CodeForces 673 A Bear and Game
- CodeForces 673A Bear and Game
- 【CodeForces】[673A]Bear and Game
- CodeForces 673 A Bear and Game
- CodeForces 673A Bear and Game
- CodeForces - 673A Bear and Game (模拟)水
- 【Codeforces Round #351 Div. 2】 673A Bear and Game
- A. Bear and Game
- 【Codeforces Round】351A - Bear and Game(水)
- codeforcs 351 A. Bear and Game
- 【codeforces】-#351A--Bear and Game(第一次cf,错到哭,还是有点开心的,嘿嘿)
- Codeforces 385A Bear and Raspberry
- CodeForces 574A - Bear and Elections
- Codeforces Round #318 A. Bear and Elections
- CodeForces #318 (div1) A.Bear and Poker
- Codeforces 574 A. Bear and Elections
- Codeforces 573 A. Bear and Poker
- axis2 webservice 调用的三种方式
- 循环矩阵傅里叶对角化
- query的DOM操作
- 【Linux】引导扇区(boot sector)的结构
- 单链表排序之冒泡排序
- CodeForces 673 A Bear and Game
- 单例模式 最简单
- 集群问题
- 设计模式笔记-Iterator迭代器模式
- 数据库SQL优化大总结之 百万级数据库优化方案
- ckeditor jsp使用实现form上传
- 添加交换空间swap
- Ion图片
- 关于MyEclipse与SQL server 的连接