제출 #330862

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
330862		Sho10	Calvinball championship (CEOI15_teams)	C++14	0 / 100	39 ms	912 KiB

teams

#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod (10*10*10*10*10*10*10*10*10+7)
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,a[10005],pref[10005],dp[1005],dp2[1005];
int32_t main(){
CODE_START;
cin>>n;
for(ll i=1;i<=n;i++)
{
    cin>>a[i];
    pref[i]=max(pref[i-1],a[i]);
}
ll ans=1;
for(ll i=n;i>=1;i--)
{
    if(i==n){
        for(ll j=1;j<=n;j++)
        {
            dp[j]=1;
        }
    }else {
    for(ll j=1;j<i;j++)
    {
dp[j]=(j*dp2[j])%mod;
dp[j]+=dp2[j+1];
dp[j]%=mod;
    }
}
ans+=((pref[i]-1)*dp[pref[i-1]])%mod;
ans%=mod;
swap(dp,dp2);
}
cout<<ans<<endl;
}

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