#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long int> top(n);
vector<long long int> front(n);
long long ans = 0;
for(int i = 0; i < n; ++i) cin >> top[i] >> front[i];
for(int i = 0; i < n; ++i){
long long minTop = top[i];
long long minFront = front[i];
for(int j = i; j < n; ++j){
minTop = min(minTop, top[j]);
minFront = min(minFront, front[j]);
long long ancho = j - i + 1;
ans = max(ans, ancho*minTop*minFront);
}
}
cout << ans << endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
340 KB |
Output is correct |
2 |
Correct |
4 ms |
340 KB |
Output is correct |
3 |
Correct |
4 ms |
340 KB |
Output is correct |
4 |
Correct |
5 ms |
308 KB |
Output is correct |
5 |
Correct |
4 ms |
340 KB |
Output is correct |
6 |
Correct |
5 ms |
312 KB |
Output is correct |
7 |
Correct |
4 ms |
312 KB |
Output is correct |
8 |
Correct |
4 ms |
336 KB |
Output is correct |
9 |
Correct |
4 ms |
340 KB |
Output is correct |
10 |
Correct |
5 ms |
340 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
5 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
340 KB |
Output is correct |
2 |
Correct |
4 ms |
340 KB |
Output is correct |
3 |
Correct |
4 ms |
340 KB |
Output is correct |
4 |
Correct |
5 ms |
308 KB |
Output is correct |
5 |
Correct |
4 ms |
340 KB |
Output is correct |
6 |
Correct |
5 ms |
312 KB |
Output is correct |
7 |
Correct |
4 ms |
312 KB |
Output is correct |
8 |
Correct |
4 ms |
336 KB |
Output is correct |
9 |
Correct |
4 ms |
340 KB |
Output is correct |
10 |
Correct |
5 ms |
340 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
5 ms |
340 KB |
Output is correct |
13 |
Execution timed out |
2559 ms |
6088 KB |
Time limit exceeded |
14 |
Halted |
0 ms |
0 KB |
- |