CodeForces 673A Bear and Game-优快云博客

本文链接：https://blog.youkuaiyun.com/shyazhut/article/details/52195399

本题描述了一只喜欢观看体育赛事的熊Limak，在面对90分钟的比赛时如何根据有趣的时间点选择观看时长的问题。若连续15分钟比赛无聊，则会关闭电视。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

http://codeforces.com/problemset/problem/673/A

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.

Examples

input
3
7 20 88

output
35

input
9
16 20 30 40 50 60 70 80 90

output
15

input
9
15 20 30 40 50 60 70 80 90

output
90

Note

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 分钟，否则关闭电视。

思路：

貌似之前做过这个题目，不知道是不是真的。但是错了一次，最后一个兴趣点也是很特殊。

具体看注释。

Code：

/*
	Name:CodeForces 673A
	Copyright:
	Author:
	Date: 12-08-16 16:00
	Description:
*/
#include<cstdio>
#include<cstring>
const int MYDD=113;

int a[MYDD];
int ti;//time

int main() {
	int n;
	while(scanf("%d",&n)!=EOF) {
		int last,now;//上一场的时间，这一场的时间
		int flag=0;//标记本场符合条件
		int ans=0;
		for(int j=1; j<=n; j++) {
			scanf("%d",&now);
			if(flag)    continue;//已经关闭了电视
			if(j==1) {
				if(now>15) {//第一场就等15分钟
					ans=15;
					flag=1;
				} else {
					ans=now;
				}
			}
			if(j>=2&&j<=n) {
				if(now-last<=15) {
					ans=now;
				} else {
					ans=last+15;
					flag=1;
				}
			}
			if(!flag) {
				if(j==n) {//最后一场
					if(90-now<=15) {
						ans=90;
					} else {
						ans=now+15;
					}
				}
			}

			last=now;
		}
		printf("%d\n",ans);
	}
	return 0;
}
/*By: Shyazhut*/