제출 #1121667

#제출 시각아이디문제언어결과실행 시간메모리
1121667vjudge1Calvinball championship (CEOI15_teams)C++17
0 / 100
86 ms696 KiB
#include <bits/stdc++.h> #define all(v) v.begin(), v.end() #define int long long using namespace std; const int sz = 1e4 + 5, mod = 1e9 + 7; int n, a[sz], mx[sz], dp[2][sz]; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for(int i = 1; i <= n; i++) { cin >> a[i]; mx[i] = max(mx[i], a[i]); } int ans = 1; dp[0][0] = 1; for(int i = 1, cur = 1; i <= n; i++, cur ^= 1) { for(int j = 1; j <= i; j++) { dp[cur][j] = (dp[cur ^ 1][j - 1] + dp[cur ^ 1][j] * j) % mod; } ans = (ans + dp[cur ^ 1][mx[i - 1]] * (a[i] - 1)) % mod; } cout << ans; }
#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...