Description
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.
Input
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.
Output
Print the number of minutes Limak will watch the game.
Sample Input
3 7 20 88
35
9 16 20 30 40 50 60 70 80 90
15
9 15 20 30 40 50 60 70 80 90
90
一道模拟题,给出感兴趣的时刻,若不感兴趣的时间段>=15,则关电视
一万个没想到最后一个时刻后还可以再看15分钟,。。。。还有边界90。。满眼的泪啊。。。。
#include <iostream> #include <cstdio> using namespace std; int main() { int n,a[100]; while(~scanf("%d",&n)) { for(int i=0;i<n;i++) scanf("%d",&a[i]); if(a[0]>15) { printf("15\n"); continue; } else { int maxn=a[0]; for(int i=1;i<n;i++) { if((a[i]-a[i-1]>15)) { break; } else { maxn=a[i]; } } maxn+=15;//注意咯..... if(maxn>=90) maxn=90; printf("%d\n",maxn); } } return 0; }