This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |