Submission #2510793
Source Code Expand
#include <iostream> #include <string> #include <algorithm> #include <vector> #include <utility> #include <cmath> #include <iomanip> #include <queue> #include <map> #include <set> #include <random> #include <sstream> #include <stack> #include <deque> using namespace std; #define REP(i,a,b) for(int i=a;i<b;i++) #define rep(i,n) REP(i,0,n) typedef long long ll; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<ll> vl; const int INF = (int) 1e9; const int MAX_V = 1000; int N; int ans = 0; int up = 1; int l = 0; int pre; int main() { cin >> N; cin >> pre; REP(i,1,N) { int h; cin >> h; if (up == 1) { if (h <= pre) { up = 0; } } else { if (h >= pre) { ans = max(ans, i-l+1); l = i; up = 1; } } pre = h; } if (up == 0) ans = max(ans, N-l); cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 山のデータ |
User | bluenote |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1050 Byte |
Status | WA |
Exec Time | 158 ms |
Memory | 764 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 30 | 0 / 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 | 8 ms | 764 KB |
subtask0-sample-02.txt | AC | 1 ms | 256 KB |
subtask1-01.txt | WA | 1 ms | 256 KB |
subtask1-02.txt | AC | 1 ms | 256 KB |
subtask1-03.txt | WA | 1 ms | 256 KB |
subtask1-04.txt | WA | 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 | WA | 1 ms | 256 KB |
subtask1-09.txt | AC | 1 ms | 256 KB |
subtask1-10.txt | WA | 1 ms | 256 KB |
subtask1-11.txt | AC | 1 ms | 256 KB |
subtask1-12.txt | AC | 1 ms | 256 KB |
subtask1-13.txt | AC | 1 ms | 256 KB |
subtask1-14.txt | AC | 1 ms | 256 KB |
subtask1-15.txt | WA | 1 ms | 256 KB |
subtask2-01.txt | AC | 9 ms | 256 KB |
subtask2-02.txt | AC | 42 ms | 256 KB |
subtask2-03.txt | WA | 79 ms | 256 KB |
subtask2-04.txt | AC | 153 ms | 256 KB |
subtask2-05.txt | AC | 156 ms | 256 KB |
subtask2-06.txt | AC | 153 ms | 256 KB |
subtask2-07.txt | AC | 157 ms | 256 KB |
subtask2-08.txt | WA | 153 ms | 256 KB |
subtask2-09.txt | AC | 156 ms | 256 KB |
subtask2-10.txt | AC | 153 ms | 256 KB |
subtask2-11.txt | AC | 158 ms | 256 KB |
subtask2-12.txt | WA | 153 ms | 256 KB |
subtask2-13.txt | AC | 158 ms | 256 KB |
subtask2-14.txt | AC | 153 ms | 256 KB |
subtask2-15.txt | AC | 158 ms | 256 KB |