zoukankan      html  css  js  c++  java
  • [Codeforces Round #351 Div. 2] 673A Bear and Game

    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 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.

    我只能说刷水题异常带感。

     1 /**/
     2 #include<iostream>
     3 #include<cstdio>
     4 #include<cmath>
     5 #include<cstring>
     6 #include<algorithm>
     7 using namespace std;
     8 int last=0,x,n;
     9 int main(){
    10     scanf("%d",&n);
    11     while(n--){
    12         scanf("%d",&x);
    13         if(x-last>15){
    14             printf("%d
    ",last+15);
    15             break;
    16         }
    17         if(!n){
    18             printf("%d
    ",min(x+15,90));
    19             break;
    20         }
    21         last=x;
    22     }
    23     return 0;
    24 }
  • 相关阅读:
    快速导出B站收藏单节目列表
    打包Python程序
    PHP应用日志记录
    这几天折腾win10访问deepin共享的历程
    PHP更新本地公网IP到阿里云域名解析,实现DDNS
    PHP.ini 能不能加载子配置文件 ?
    PHP处理表单数据的一个安全回顾(记录教训)
    不用U盘,用一台好电脑给另一个电脑重装windows10
    方正 ignb路由器设置备份(自用笔记)
    Xiuno BBS 4.0 修改时间显示
  • 原文地址:https://www.cnblogs.com/SilverNebula/p/5823501.html
Copyright © 2011-2022 走看看