제출 #1107701

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