제출 #1086448

#제출 시각아이디문제언어결과실행 시간메모리
1086448juicyCalvinball championship (CEOI15_teams)C++17
100 / 100
211 ms856 KiB
#include <bits/stdc++.h> using namespace std; #ifdef LOCAL #include "debug.h" #else #define debug(...) 42 #endif const int N = 10005, M = 1000007; void add(int &x, int y) { if ((x += y) >= M) { x -= M; } } int n; int a[N], ma[N], dp[N]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> n; for (int i = 1; i <= n; ++i) { cin >> a[i]; ma[i] = max(ma[i - 1], a[i - 1]); } fill(dp + 1, dp + n + 1, 1); int res = 1; for (int i = n; i >= 1; --i) { add(res, (long long) dp[ma[i]] * (a[i] - 1) % M); for (int j = 1; j <= n; ++j) { dp[j] = (long long) dp[j] * j % M; add(dp[j], dp[j + 1]); } } cout << res; 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...