Codeforces Round #373 (Div. 2) A. Vitya in the Countryside
2016-09-24 21:02
405 查看
题目大意:
给出一些数,找到规律,看月亮石变大还是变小
题目连接
解题思路:
这个题还是比较水的题目,当只有一个的时候特判0和15,其余的都没法知道,最后一个是0 或15时比较好判,别的情况就是后一位比前一位大就是UP,不然就是DOWN
#include<stdio.h>
#include<algorithm>
using namespace std;
const int maxn=93;
int a[maxn];
int main(){
int n;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
if(n==1){
if(a[0]!=0 && a[0]!=15){
printf("-1\n");
return 0;
}
}
if(a[n-1]==0){
printf("UP\n");
return 0;
}
if(a[n-1]==15) {
printf("DOWN\n");
return 0;
}
if(a[n-1]-a[n-2]>0) printf("UP\n");
if(a[n-1]-a[n-2]<0) printf("DOWN\n");
return 0;
}
给出一些数,找到规律,看月亮石变大还是变小
题目连接
解题思路:
这个题还是比较水的题目,当只有一个的时候特判0和15,其余的都没法知道,最后一个是0 或15时比较好判,别的情况就是后一位比前一位大就是UP,不然就是DOWN
#include<stdio.h>
#include<algorithm>
using namespace std;
const int maxn=93;
int a[maxn];
int main(){
int n;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
if(n==1){
if(a[0]!=0 && a[0]!=15){
printf("-1\n");
return 0;
}
}
if(a[n-1]==0){
printf("UP\n");
return 0;
}
if(a[n-1]==15) {
printf("DOWN\n");
return 0;
}
if(a[n-1]-a[n-2]>0) printf("UP\n");
if(a[n-1]-a[n-2]<0) printf("DOWN\n");
return 0;
}
相关文章推荐
- Codeforces Round #373 (Div. 2) A. Vitya in the Countryside
- Codeforces-719A-Vitya in the Countryside
- Codeforces Round #373 (Div. 2) A.Vitya in the Countryside
- 华东交通大学2016届新生选拔赛:1003 Vitya in the Countryside
- Codeforces Round #373 (Div. 2) A. Vitya in the Countryside —— 基础题
- codeforces 719A:Vitya in the Countryside
- Codeforces Round #373 (Div. 2) A. Vitya in the Countryside 水题
- 【Codeforces Round #430 (Div. 2) D】Vitya and Strange Lesson
- Coder-Strike 2014 - Finals (online edition, Div. 2) D.Bug in Code
- Codeforces Round #274 (Div. 2) E. Riding in a Lift(DP)
- 【Codeforces Round #430 (Div. 2) D】 D. Vitya and Strange Lesson ("带lazy" 的字典树)
- Coder-Strike 2014 - Finals (online edition, Div. 2)——Bug in Code
- Codeforces Round #313 (Div. 2) A. Currency System in Geraldion 水题
- Codeforces Round #326 (Div. 2)B. Duff in Love
- Codeforces Round #326 (Div. 2) 588 B. Duff in Love
- Codeforces Round #430 (Div. 2) D. Vitya and Strange Lesson [trie]
- Codeforces Round #189 (Div. 1) Kalila and Dimna in the Logging Industry 斜率DP
- SRM 578 Div II Level Three: WolfInZooDivTwo,Dynamic Programming,求教!
- 如何移除样式为display:inline-block的两个div间存在6px的缝隙
- Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined) E. Palindromes in a Tree(点分治)