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>
#define int long long
using namespace std;
const int mod = 1e6 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
int dp[1005][1005][2];
signed main() {
int n;
cin >> n;
vector<int> v(n+1);
for(int i=1; i<=n; i++) cin >> v[i];
dp[1][1][0] = 1;
for(int a=1; a<n; a++) {
for(int b=1; b<=a; b++) {
for(int c=0; c<2; c++) {
for(int i=1; i<=b+1; i++) {
if(!c && i > v[a+1]) break;
dp[a+1][max(b, i)][c|(i<v[a+1])] = (dp[a+1][max(b, i)][c|(i<v[a+1])] + dp[a][b][c]) % mod;
}
}
}
}
long long ans = 0;
for(int i=1; i<=n; i++) ans = (ans + dp[n][i][1]) % mod;
cout << (ans + 1) % mod << '\n';
return 0;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |