제출 #1107700

#제출 시각아이디문제언어결과실행 시간메모리
110770012345678Calvinball championship (CEOI15_teams)C++17
30 / 100
1067 ms592 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long const int nx=1e4+5, mod=1e6+7; ll n, a[nx], h, res; ll solve(ll l, ll mx) { if (l==0) return 1; return (solve(l-1, mx)*mx+solve(l-1, mx+1))%mod; } int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>n; for (int i=1; i<=n; i++) { cin>>a[i]; for (int j=1; j<a[i]; j++) res=(res+solve(n-i, h))%mod; h=max(h, a[i]); } cout<<res+1; }
#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...