제출 #573332

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

teams

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
const ll MOD = 1e6 + 7;

int n;
vector<int> a;
//vector< vector<ll> > dp;
ll dp[10100][10100];

int main ()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n;

    a.resize( n );

    for ( auto& el : a )
        cin >> el;

    //dp.assign( n+1, vector<ll>( n+1, 0 ) );

    for ( int i=0; i < 10100; i++ )
    for ( int j=0; j < 10100; j++ )
        dp[i][j] = 0;

    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++ )
    {
        if ( j+1 <= n )
            dp[i][j] = ( j*dp[i-1][j] + dp[i-1][j+1] ) % MOD;
        else
            dp[i][j] = j*dp[i-1][j] % MOD;
    }

    ll ans = 1;

    int maxi = 0;

    for ( int i=0; i<n; i++ )
    {
        for ( int j=1; j<a[i]; j++ )
            ans = ( ans + dp[n-i-1][ max(maxi,j) ] ) % MOD;

        maxi = max( maxi, a[i] );
    }

    cout << ans;

    return 0;
}

• 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