제출 #230127

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
230127		nicolaalexandra	Calvinball championship (CEOI15_teams)	C++14	100 / 100	397 ms	608 KiB

teams

#include <bits/stdc++.h>
#define DIM 10010
#define MOD 1000007
using namespace std;
int v[DIM],maxi[DIM],dp[2][DIM];
int n,i,j;
int main (){

   // ifstream cin ("teams.in");
   // ofstream cout ("teams.out");

    cin>>n;
    for (i=1;i<=n;i++){
        cin>>v[i];
        maxi[i] = max (maxi[i-1],v[i]);
    }

    /// dp[i][j] - in cate moduri pot construi un sir cu i elemente stiind ca am pus pana la j deja
    for (i=0;i<=n;i++)
        dp[0][i] = 1;

    int sol = v[n], t = 1;
    for (i=1;i<n;i++){
        for (j=1;j<=n;j++)
            dp[t][j] = (dp[1-t][j+1] + 1LL * dp[1-t][j] * j % MOD) % MOD;

        sol = (sol + 1LL * dp[t][maxi[n-i-1]] * (v[n-i]-1) % MOD) % MOD;
        t = 1-t;
    }

    cout<<sol;

    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