Submission #3476840
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
//#pragma GCC optimize ("-O3")
#ifdef YANG33
#include "mydebug.hpp"
#else
#define DD(x)
#endif
const int INF = 1e9; const LL LINF = 1e16;
const LL MOD = 1000000007; const double PI = acos(-1.0);
int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 }; int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };
/* ----- 2018/10/24 Problem: ARC 036 B / Link: http://arc036.contest.atcoder.jp/tasks/arc036_b ----- */
/* ------問題------
-----問題ここまで----- */
/* -----解説等-----
----解説ここまで---- */
LL ans = 0LL;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
LL N; cin >> N;
VL h(N);
FOR(i, 0, N) {
cin >> h[i];
}
auto f = [](const VL& a) {
int N = SZ(a);
VL res(N,0);
FOR(i, 0, N-1) {
if (a[i] < a[i + 1]) {
res[i+1] = res[i] + 1;
}
else {
res[i+1] = 0;
}
}
return res;
};
VL L = f(h);
reverse(ALL(h));
VL R = f(h);
reverse(ALL(R));
DD(De(L, R));
FOR(i, 0, N) {
ans = max(ans, L[i] + R[i] + 1);
}
cout << ans << "\n";
return 0;
}
Submission Info
Submission Time |
|
Task |
B - 山のデータ |
User |
Yang33 |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1738 Byte |
Status |
AC |
Exec Time |
37 ms |
Memory |
7296 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Score / Max Score |
0 / 0 |
30 / 30 |
70 / 70 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
subtask0-sample-01.txt, subtask0-sample-02.txt |
Subtask1 |
subtask0-sample-01.txt, subtask0-sample-02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt |
Subtask2 |
subtask0-sample-01.txt, subtask0-sample-02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0-sample-01.txt |
AC |
1 ms |
256 KB |
subtask0-sample-02.txt |
AC |
1 ms |
256 KB |
subtask1-01.txt |
AC |
1 ms |
256 KB |
subtask1-02.txt |
AC |
1 ms |
256 KB |
subtask1-03.txt |
AC |
1 ms |
256 KB |
subtask1-04.txt |
AC |
1 ms |
256 KB |
subtask1-05.txt |
AC |
1 ms |
256 KB |
subtask1-06.txt |
AC |
1 ms |
256 KB |
subtask1-07.txt |
AC |
1 ms |
256 KB |
subtask1-08.txt |
AC |
1 ms |
256 KB |
subtask1-09.txt |
AC |
1 ms |
256 KB |
subtask1-10.txt |
AC |
1 ms |
256 KB |
subtask1-11.txt |
AC |
1 ms |
256 KB |
subtask1-12.txt |
AC |
1 ms |
256 KB |
subtask1-13.txt |
AC |
2 ms |
256 KB |
subtask1-14.txt |
AC |
1 ms |
256 KB |
subtask1-15.txt |
AC |
1 ms |
256 KB |
subtask2-01.txt |
AC |
3 ms |
640 KB |
subtask2-02.txt |
AC |
11 ms |
2176 KB |
subtask2-03.txt |
AC |
18 ms |
3712 KB |
subtask2-04.txt |
AC |
33 ms |
7296 KB |
subtask2-05.txt |
AC |
33 ms |
7296 KB |
subtask2-06.txt |
AC |
33 ms |
7296 KB |
subtask2-07.txt |
AC |
36 ms |
7296 KB |
subtask2-08.txt |
AC |
33 ms |
7296 KB |
subtask2-09.txt |
AC |
33 ms |
7296 KB |
subtask2-10.txt |
AC |
33 ms |
7296 KB |
subtask2-11.txt |
AC |
37 ms |
7296 KB |
subtask2-12.txt |
AC |
33 ms |
7296 KB |
subtask2-13.txt |
AC |
36 ms |
7296 KB |
subtask2-14.txt |
AC |
33 ms |
7296 KB |
subtask2-15.txt |
AC |
37 ms |
7296 KB |