제출 #334550

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
334550		mehrdad_sohrabi	Calvinball championship (CEOI15_teams)	C++14	100 / 100	724 ms	620 KiB

teams

#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < ll , ll >
#define F first
#define S second
#define endl '\n'
//#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#define kill(x) return cout<<x<<'\n', 0;
using namespace std;
const int N=1e4+100;
int dp[2][N];
int a[N];
int mod=1e6+7;
int par[N];
int32_t main(){
    sync;
    ll n;
    cin >> n;
    for (int i=1;i<=n;i++){
        cin >> a[i];
    }
    for (int i=1;i<=n;i++){
        par[i]=max(par[i-1],a[i]);
    }
    for (int i=0;i<=n;i++){
        dp[0][i]=1;
    }
    ll ans=a[n];
    for (int i=1;i<n;i++){
        for (int j=1;j<=n;j++){
            dp[i%2][j]= (1ll * dp[(i-1)%2][j]*j+(ll)dp[(i-1)%2][j+1]) %(ll)mod;
           // dp[i%2][j]%=mod;
            //cout << i << " " << j << " " << dp[i][par] << endl;
        }
            ans+=1ll * dp[i%2][par[n-i-1]]*(a[n-i]-1)%(ll)mod;
    }
    cout << ans%mod;


}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10