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;
#define int long long
signed main () {
int n;
cin >> n;
pair <int, int> arr[n + 1];
for (int i = 1; i <= n; i++) cin >> arr[i].first >> arr[i].second;
int ans = 0;
for (int i = 1; i <= n; i++) {
int mn1 = 1e9, mn2 = 1e9;
for (int j = i; j <= n; j++) {
mn1 = min(mn1, arr[j].first);
mn2 = min(mn2, arr[j].second);
ans = max(ans, mn1 * mn2 * (j - i + 1));
}
}
cout << ans << '\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |