Submission #711585

#	Time	Username	Problem	Language	Result	Execution time	Memory
711585		RaulAndrei01	Calvinball championship (CEOI15_teams)	C++14	100 / 100	194 ms	636 KiB

teams

#include <iostream>

using namespace std;
using ll = long long;
const int mod = 1e6 + 7;
const int nmax = 1e4 + 2;
ll dp[2][nmax];
ll a[nmax];

int main()
{
    ll n; cin >> n;


    ll maxx = 0;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];



        for (int k = n; k > 0; k--)
        {
            dp[i%2][k] = dp[(i-1)%2][k-1] + dp[(i-1)%2][k] * k;
         //   cout << i << ' ' << k << ' ' << dp[i % 2][k] << '\n';
            dp[i%2][k] %= mod;
        }
        dp[i%2][maxx] += a[i] - 1;
        dp[i%2][maxx] %= mod;
        maxx = max(maxx , a[i]);
    }

    ll ans = 0;
    for (int i = 1; i <= n; i++)
    {
        ans += dp[n % 2][i];
        ans %= mod;
    }
    cout << (ans + 1) % mod << '\n';

    return 0;
}

• 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