Submission #109281

#TimeUsernameProblemLanguageResultExecution timeMemory
109281dupreezCalvinball championship (CEOI15_teams)C++14
10 / 100
84 ms63648 KiB
#include <iostream> #include <algorithm> #include <cstring> #include <sstream> #include <map> #include <queue> #include <vector> #include <deque> #include <climits> #define scanf scanf_s #define mk make_pair #define pb push_back using namespace std; typedef long long int ll; typedef pair<ll, ll> pos; const ll MOD = 1000000007, N = 2010.; ll n, a[N], ans = 0,dp[N][N],dp2[N][N]; ll cal(ll lgt, ll knd) { return dp[lgt][knd] + dp2[lgt][knd + 1]; } int main() { for (int i = 1; i < N; i++) { dp[1][i] = i; dp2[1][i] = 1; dp[0][i] = 1; } for (int i = 2; i < N; i++) { for (int j = 1; j < N - 1; j++) { dp[i][j] = (dp[i - 1][j] * j + dp2[i - 1][j + 1]) % MOD; dp2[i][j] = (dp[i - 1][j] + dp2[i - 1][j + 1]) % MOD; } } cin >> n; for (int i = 1; i <= n; i++)cin >> a[i]; ll knd = 0; for (int i = 1; i <= n; i++) { ll v1 = (a[i] - 1) * cal(n - i, knd); v1 %= MOD; ans = (ans + v1) % MOD; knd = max(knd, a[i]); } ans = (ans + 1) % MOD; cout << ans << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...