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][(1<v[1])] = 1;
    for(int i=1; i<n; i++) {
        for(int j=1; j<=i; j++) {
            for(int k=0; k<2; k++) {
                for(int x=1; x<=j+1; x++) {
                    if(!k && x > v[i+1]) break;
                    dp[i+1][max(j, k)][k|(x<v[i+1])] = (dp[i+1][max(j, k)][k|(x<v[i+1])] + dp[i][j][k]) % 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... |