제출 #569952

#제출 시각아이디문제언어결과실행 시간메모리
569952600MihneaCalvinball championship (CEOI15_teams)C++17
100 / 100
229 ms420 KiB
#include <bits/stdc++.h> using namespace std; const int N = 10000 + 7; const int M = 1000007; int n, a[N], mx[N], ways[N]; signed main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; mx[i] = max(mx[i - 1], a[i]); ways[i] = 1; } int sol = 1; for (int i = n; i >= 1; i--) { sol = (sol + 1LL * (a[i] - 1) * (ways[mx[i - 1]])) % M; for (int j = 1; j <= n; j++) { ways[j] = (1LL * j * ways[j] + ways[j + 1]) % M; } } cout << sol << "\n"; }
#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...