#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000007;
int main(){
long long n;
cin >> n;
long long dp[2][1 + n];
long long cur = n % 2;
long long a[1 + n];
long long prefMax[1 + n];
prefMax[0] = 0;
for(long long i = 1; i <= n; i++){
cin >> a[i];
prefMax[i] = max(prefMax[i - 1], a[i]);
dp[cur][i] = 1;
}
long long ans = 1;
for(long long i = n - 1; i > 0; i--, cur ^= 1){
ans = (ans + dp[cur][prefMax[i]] * (a[i + 1] - 1)) % MOD;
for(long long j = 1; j <= i; j++){
dp[!cur][j] = (dp[cur][j] * j + dp[cur][j + 1]) % MOD;
}
}
cout << ans << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
312 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
2 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
324 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
71 ms |
576 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
340 KB |
Output is correct |
2 |
Correct |
22 ms |
456 KB |
Output is correct |
3 |
Correct |
19 ms |
468 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
75 ms |
596 KB |
Output is correct |
2 |
Correct |
72 ms |
620 KB |
Output is correct |
3 |
Correct |
73 ms |
632 KB |
Output is correct |