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;
const int maxn = 200010;
int n, a[maxn], b[maxn];
int main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i] >> b[i];
}
long long ans = 0;
for (int i = 1; i <= n; i++) {
int foo = INT_MAX, bar = INT_MAX;
for (int j = i; j <= n; j++) {
foo = min(foo, a[j]), bar = min(bar, b[j]);
ans = max(ans, 1LL * foo * bar * (j - i + 1));
}
}
cout << ans << "\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |