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;
typedef long long ll;
#define mod 1000000007
#define int long long
long long bin(long long x){
x %= mod;
return ((x*(x+1))/2)%mod;
}
long long rec(long long x, long long y){
return (bin(x)*bin(y))%mod;
}
int32_t main () {
int n;
cin >> n;
ll ans = 0;
vector<int> h;
for(int i = 0;i<n;i++) {
int hi;
cin >> hi;
h.push_back(hi);
}
for(int i = 0;i<n;i++) {
int w;cin>>w;
}
for(int i = 0;i<n;i++) {
int MIN = h[i];
for(int j = i+1;j<=n;j++) {
MIN = min(MIN, h[j - 1]);
ans += bin(MIN);
ans%=mod;
}
}
cout<<ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |