# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
30072 | 2017-07-22T04:38:02 Z | tlwpdus | Temperature (POI11_tem) | C++11 | 439 ms | 12604 KB |
#include <bits/stdc++.h> using namespace std; typedef pair<int,int> pii; int n; int S[1000100], E[1000100]; deque<pii> dq; void push(pii a) { while(!dq.empty()&&dq.back().second<=a.second) dq.pop_back(); dq.push_back(a); } int main() { int i, j, res = 1; scanf("%d",&n); for (i=0;i<n;i++) scanf("%d%d",&S[i],&E[i]); i = 0; j = -1; for (;i<n;i++) { if (!dq.empty()&&dq.front().first<i) dq.pop_front(); if (j<i) {j=i;push(pii(j,S[j]));} for (;j+1<n;) { if (dq.front().second<=E[j+1]) {j++;push(pii(j,S[j]));} else break; } res = max(res,j-i+1); } printf("%d\n",res); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 9832 KB | Output is correct |
2 | Correct | 0 ms | 9832 KB | Output is correct |
3 | Correct | 0 ms | 9832 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 9832 KB | Output is correct |
2 | Correct | 0 ms | 9832 KB | Output is correct |
3 | Correct | 0 ms | 9832 KB | Output is correct |
4 | Correct | 0 ms | 9832 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 9832 KB | Output is correct |
2 | Correct | 3 ms | 9832 KB | Output is correct |
3 | Correct | 3 ms | 9832 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 103 ms | 9832 KB | Output is correct |
2 | Correct | 113 ms | 9832 KB | Output is correct |
3 | Correct | 139 ms | 9832 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 243 ms | 9832 KB | Output is correct |
2 | Correct | 243 ms | 9832 KB | Output is correct |
3 | Correct | 276 ms | 11672 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 299 ms | 9832 KB | Output is correct |
2 | Correct | 273 ms | 9832 KB | Output is correct |
3 | Correct | 366 ms | 12076 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 409 ms | 9832 KB | Output is correct |
2 | Correct | 299 ms | 9832 KB | Output is correct |
3 | Correct | 439 ms | 12604 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 346 ms | 10360 KB | Output is correct |
2 | Correct | 269 ms | 10348 KB | Output is correct |
3 | Correct | 219 ms | 9832 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 206 ms | 9832 KB | Output is correct |
2 | Correct | 186 ms | 9832 KB | Output is correct |
3 | Correct | 189 ms | 9832 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 176 ms | 9832 KB | Output is correct |
2 | Correct | 166 ms | 9832 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 259 ms | 9832 KB | Output is correct |
2 | Correct | 343 ms | 12472 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 263 ms | 9832 KB | Output is correct |
2 | Correct | 399 ms | 12208 KB | Output is correct |