Codeforces-719A-Vitya in the Countryside
来源:互联网 发布:人工智能从入门到精通 编辑:程序博客网 时间:2024/05/20 03:08
Every summer Vitya comes to visit his grandmother in the countryside. This summer, he got a huge wart. Every grandma knows that one should treat warts when the moon goes down. Thus, Vitya has to catch the moment when the moon is down.
Moon cycle lasts 30 days. The size of the visible part of the moon (in Vitya’s units) for each day is 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, and then cycle repeats, thus after the second 1 again goes 0.
As there is no internet in the countryside, Vitya has been watching the moon for n consecutive days and for each of these days he wrote down the size of the visible part of the moon. Help him find out whether the moon will be up or down next day, or this cannot be determined by the data he has.
Input
The first line of the input contains a single integer n (1 ≤ n ≤ 92) — the number of consecutive days Vitya was watching the size of the visible part of the moon.
The second line contains n integers ai (0 ≤ ai ≤ 15) — Vitya’s records.
It’s guaranteed that the input data is consistent.
Output
If Vitya can be sure that the size of visible part of the moon on day n + 1 will be less than the size of the visible part on day n, then print “DOWN” at the only line of the output. If he might be sure that the size of the visible part will increase, then print “UP”. If it’s impossible to determine what exactly will happen with the moon, print -1.
Examples
Input
5
3 4 5 6 7
Output
UP
Input
7
12 13 14 15 14 13 12
Output
DOWN
Input
1
8
Output
-1
Note
In the first sample, the size of the moon on the next day will be equal to 8, thus the answer is “UP”.
In the second sample, the size of the moon on the next day will be 11, thus the answer is “DOWN”.
In the third sample, there is no way to determine whether the size of the moon on the next day will be 7 or 9, thus the answer is -1.
题意:给你一个序列,问下一个是上升还是下降
题解:找转折点就好了
#include<cstdio>#include<cstring>#include<iostream>using namespace std;int main(){ int n; while(scanf("%d",&n)!=EOF) { int a[105]; for(int i=0;i<n;i++) scanf("%d",&a[i]); if(n==1) { if(a[0]==15) { printf("DOWN\n"); continue; } else if(a[0]==0) { printf("UP\n"); continue; } else { printf("-1\n"); continue; } } else { if(a[n-1]==0&&a[n-2]==1) { printf("UP\n"); continue; } else if(a[n-1]==15&&a[n-2]==14) { printf("DOWN\n"); continue; } else if(a[n-1]>a[n-2]) { printf("UP\n"); } else { printf("DOWN\n"); } } } return 0;}
- Codeforces 719A-Vitya in the Countryside
- CodeForces 719 A. Vitya in the Countryside
- Codeforces-719A-Vitya in the Countryside
- CodeForces 719A. Vitya in the Countryside
- codeforces 719A Vitya in the Countryside
- Codeforces 719A A. Vitya in the Countryside
- codeforces A. Vitya in the Countryside
- 【32.89%】【codeforces 719A】Vitya in the Countryside
- CodeForces-719A. Vitya in the Countryside(模拟)
- A. Vitya in the Countryside
- Codeforces Round #373 (Div. 2) A. Vitya in the Countryside
- Codeforces Round #373 (Div. 2) A.Vitya in the Countryside
- Codeforces Round #373 (Div. 2) A. Vitya in the Countryside
- CodeForces 719A Vitya in the Countryside(月有阴晴圆缺,第二次打CF)
- Codeforces Round #373 (Div. 2) A. Vitya in the Countryside 解题报告
- Codeforces Round #373 (Div. 2) A. Vitya in the Countryside 水题
- Codeforces Round #373 (Div. 2) A. Vitya in the Countryside —— 基础题
- 华东交通大学2016届新生选拔赛:1003 Vitya in the Countryside
- MATLAB学习笔记
- 静态方法与实例方法
- MongDB
- centos中yum采用光盘为软件安装源
- DrawerLayout使用
- Codeforces-719A-Vitya in the Countryside
- MongDB基础学习(一)
- vs2010 LINK : fatal error LNK1123: 转换到 COFF 期间失败:
- python函数参数介绍
- ubuntu命令
- MongDB基础学习(二)
- 详解alloc、init 自定义初始化方法
- Matlab 读取 XML文件
- MongDB基础学习(三)