# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
221650 | Lawliet | Calvinball championship (CEOI15_teams) | C++17 | 12 ms | 4352 KiB |
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 MAXN = 1010;
const int MOD = 1000007;
int n;
int v[MAXN];
int dp[MAXN][MAXN];
int solve(int i, int j)
{
int& ans = dp[i][j];
if( ans != -1 ) return ans;
if( i == n + 1 ) return ans = 1;
ans = solve( i + 1 , j + 1 );
ans += j*solve( i + 1 , j );
ans %= MOD;
return ans;
}
int main()
{
scanf("%d",&n);
memset( dp , -1 , sizeof(dp) );
for(int i = 1 ; i <= n ; i++)
scanf("%d",&v[i]);
int ans = 0;
int maxValue = 0;
for(int i = 1 ; i <= n ; i++)
{
ans += solve( i + 1 , maxValue )*( v[i] - 1 );
maxValue = max( maxValue , v[i] );
ans %= MOD;
}
ans++;
ans %= MOD;
printf("%d\n",ans);
}
Compilation message (stderr)
# | 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... |