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;
int a[n], b[n];
for (int i = 0; i < n; i ++)
cin >> a[i] >> b[i];
long long ans = 0;
for (int i = 0; i < n; i ++){
int mn1 = a[i];
int mn2 = b[i];
for (int j = i; j < n; j ++){
mn1 = min(mn1, a[j]);
mn2 = min(mn2, b[j]);
ans = max(ans, 1ll * mn1 * mn2 * (j - i + 1));
}
}
cout << ans << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |