CodeForces
来源:互联网 发布:网络侵权的管辖 编辑:程序博客网 时间:2024/06/05 23:39
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.
#include<stdio.h>int main(){ int a[90],n; while(scanf("%d",&n)!=EOF) { int i; for(i=0;i<n;i++) { scanf("%d",&a[i]); } int ans=15; if(a[0]>15) { printf("%d\n",ans); continue; } if(a[0]<=15) ans=a[0]; for(i=1;i<n;i++) { int temp=a[i]-a[i-1]; if(temp>15) { ans=a[i-1]+15; break; } else { ans=a[i]; } } if(ans==a[n-1]) ans=ans+15; if(ans>90) ans=90; printf("%d\n",ans); }}
- codeforces~~~
- Codeforces
- codeforces
- Codeforces
- codeforces
- codeforces
- Codeforces
- Codeforces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- salesforce获取RecordTypeId的两种方法
- 51nod 1119 机器人走方格 V2 费马小定理求组合数
- Unreal Engine4 初学第一天
- 中国剩余定理 Biorhythms HDU
- 传值调用、传址调用
- CodeForces
- 事务是什么,以及事务四个特性
- sizeof()为什么不能得到指针指向内容的大小
- 【HDU】1241--Oil Deposits(DFS)
- day4-java&oracle总结
- java匿名内部类
- 7.31
- BIM应用平台简介
- es 查询