제출 #1122100

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1122100		HasanV11010238	Calvinball championship (CEOI15_teams)	C++17	100 / 100	276 ms	848 KiB

teams

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long long
#define mod 1000007
int main(){
    int n;
    cin>>n;
    vector<ll> v(n + 1, 0), pr(n + 1, 0);
    for (int i = 1; i <= n; i++){
        cin>>v[i];
        pr[i] = max(pr[i - 1], v[i]);
    }
    vector<vector<ll>> dp(2, vector<ll>(n + 1, 0));
    for (int i = 0; i <= n; i++){
        dp[1][i] = 1;
    }
    ll ans = 0, la = 0;
    for (int i = n; i >= 1; i--){
        for (int j = 1; j <= i; j++){
            dp[0][j] = dp[1][j] * j;
            dp[0][j] += dp[1][j + 1];
            dp[0][j] %= mod;
        }
        ll su = v[i] - 1;
        la = pr[i - 1];
        for (int j = 1; j <= su; j++){
            ans += dp[1][max(la, (ll)j)];
            ans %= mod;
        }
        ans %= mod;
        la = max(v[i], la);
        swap(dp[0], dp[1]);
        dp[0].assign(n + 1, 0);
    }
    cout<<(ans + 1) % mod<<"\n";
}

• 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