#include <bits/stdc++.h>
using namespace std;
void setup()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int mod = 1000007;
int n, f[10002], g[10002], a[10002], res = 1;
int main()
{
setup();
cin >> n;
for (int i = 1; i <= n; ++i)
{
cin >> a[i];
}
reverse(a + 1, a + 1 + n);
fill_n(f, n + 2, 1);
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n - i + 1; ++j)
{
g[j] = (f[j + 1] + g[j - 1]) % mod;
}
(res += g[a[i] - 1]) %= mod;
for (int j = 1; j <= n; ++j)
{
f[j] = g[j];
}
}
cout << res;
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... |