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;
const int mod = 1000007;
int n, v[10002];
int dp[2][10002];
int add(int a, int b)
{
int ans = a+b;
if(ans >= mod)
ans -= mod;
return ans;
}
long long mul(long long a, long long b)
{
return (a * b) % mod;
}
int main()
{
cin >> n;
int maxi = 1;
for(int i = 1; i <= n; ++i)
{
cin >> v[i];
dp[1][max(v[i], maxi) - (v[i] > maxi)] = v[i] - 1;
maxi = max(maxi, v[i]);
for(int j = 1; j <= i; ++j)
{
dp[1][j] = add(dp[1][j], mul(dp[0][j], j));
dp[1][j+1] = add(dp[1][j+1], dp[0][j]);
}
memcpy(dp[0], dp[1], sizeof(dp[1]));
memset(dp[1], 0, sizeof(dp[1]));
}
int sum = 1;
for(int i = 1; i <= n; ++i)
sum = add(sum, dp[0][i]);
cout << sum;
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... |