This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(998244353)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
ll a[10000],b[100000];
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)cin>>a[i]>>b[i];
ll ans = 0;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
ll cost =(j-i+1);
ll mna = INF,mnb = INF;
for(int k=i;k<=j;k++){
mna = min(mna,ll(a[k]));
mnb = min(mnb,ll(b[k]));
}
cost*=mna;
cost*=mnb;
ans = max(ans,cost);
}
}
for(int i=0;i<n;i++){
for(int j=i;j<n;j++){
ll cost =(j-i+1);
ll mna = INF,mnb = INF;
for(int k=i;k<=j;k++){
mna = min(mna,ll(a[k]));
mnb = min(mnb,ll(b[k]));
}
cost*=mna;
cost*=mnb;
//if(cost == ans)cout<<i<<" "<<j<<'\n';
}
}
cout<<ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |