【codeforces】-#351A--Bear and Game(第一次cf,错到哭,还是有点开心的,嘿嘿)


A. Bear and Game
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Bear Limak likes watching sports on TV. He is going to watch a game today. The game lasts 90minutes 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.



做题理清思路,比上来就乱打,重要得多!!!

一下是优化的代码。

<pre name="code" class="cpp">#include<stdio.h>  
int main()  
{  
    int n;  
    int a[99];  
    int flag;  
    a[0]=0;  
    while(~scanf("%d",&n))  
    {  
        flag=0;  
        for(int i=1;i<=n;i++)  
        {  
            scanf("%d",&a[i]);  
        }  
        if((a[1]-a[0])>15)  
        {  
            printf("15\n");  
        }  
        else
        {
        	 for(int i=1;i<=(n-1);i++)  
	        {  
	            if((a[i+1]-a[i])>15)  
	            {  
	                printf("%d\n",a[i]+15);  
	                flag=1;  
	                break;   
	            }  
	        }  
	        if(flag!=1) 
	        {  
	            if(90-a[n]>15)  
	                printf("%d\n",a[n]+15);  
	            else  
	                printf("90\n");  
	        }   
		}
    }  
    return 0;     
}   


 

师父代码,要简单,短很多啊!

#include <cstdio>
int main()
{
	int n;
	int a[100];
	int ans;
	while (~scanf ("%d",&n))
	{
		for (int i = 1 ; i <= n ; i++)
			scanf ("%d",&a[i]);
		ans = 15;
		int i;
		for (i = 1 ; i <= n ; i++)
		{
			if (a[i] <= ans)
				ans = a[i] + 15;
			else
				break;
		}
		if (ans > 90)
			ans = 90;
		printf ("%d\n",ans);
	}
	return 0;
}



  • 2
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值