CodeFroces 831A. Unimodal Array(构造题)
2017-07-14 16:12
483 查看
http://codeforces.com/problemset/problem/831/A
题目大意:给出一个序列,问他是否由前面上升,中间相同,后面下降的结构组成。
解法:直接按照题目要求写一遍上升,保持不变,下降,看指针是否最后是否为n
代码如下:
#include<bits/stdc++.h>
using namespace std;
int main() {
int n, a[105];
cin >> n;
for(int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int key = 0;
for(; key + 1 < n; key++) {
if(a[key] >= a[key + 1])
break;
}
for(; key + 1 < n; key++) {
if(a[key] != a[key + 1])
break;
}
for(; key + 1 < n; key++) {
if(a[key] <= a[key + 1])
break;
}
if(key == n - 1)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
题目大意:给出一个序列,问他是否由前面上升,中间相同,后面下降的结构组成。
解法:直接按照题目要求写一遍上升,保持不变,下降,看指针是否最后是否为n
代码如下:
#include<bits/stdc++.h>
using namespace std;
int main() {
int n, a[105];
cin >> n;
for(int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int key = 0;
for(; key + 1 < n; key++) {
if(a[key] >= a[key + 1])
break;
}
for(; key + 1 < n; key++) {
if(a[key] != a[key + 1])
break;
}
for(; key + 1 < n; key++) {
if(a[key] <= a[key + 1])
break;
}
if(key == n - 1)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
相关文章推荐
- CodeForces 831A Unimodal Array
- CodeForces 831A-Unimodal Array
- Codeforces - 831A. Unimodal Array - 模拟
- CodeForces 831A:Unimodal Array(模拟)
- codeforces 831A Unimodal Array
- E - Unimodal Array CodeForces - 831A
- E - Unimodal Array CodeForces - 831A
- (CodeForces - 831A)Unimodal Array
- CodeForces - 831A Unimodal Array
- A. Unimodal Array(段增减性
- Codeforces #831A: Unimodal Array 题解
- A. Unimodal Array
- CodeFroces 817A Treasure Hunt(构造题)
- JSONArray构造方法在不同API上的区别
- Codeforces Round #424 (Div. 2) A. Unimodal Array(水题)
- Codeforces Round #424 (Div. 2) A. Unimodal Array
- CodeForces - 831A Unimodal Array 模拟
- Codeforces Round #424 (Div. 2) A. Unimodal Array
- CodeForces - 831A Unimodal Array 模拟
- CodeFroces 823B. Petya and Exam(构造题)