#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int n;
cin>>n;
int a[n],b[n];
for (int i = 0;i<n;i++) {
cin>>a[i]>>b[i];
}
int ans = 0;
for (int i = 0;i<n;i++) {
for (int j = i;j<n;j++) {
//int l = 1000000;
//int w = 1000000;
//for (int m = i;m<=j;m++) {
// l = min(l,a[m]);
// w = min(w,b[m]);
//}
//ans = max(ans,l*w*(j-i+1));
ans+=1; //just see if this time complexity works...
}
}
cout<<ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |