제출 #90737

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
90737		FutymyClone	Calvinball championship (CEOI15_teams)	C++14	100 / 100	175 ms	1232 KiB

teams

#include <bits/stdc++.h>

using namespace std;

const int N = 1e4 + 5;
const int mod = 1e6 + 7;

int n, a[N], f[N];
vector <int> dp, dp2;

int readInt(){
    char c;
    int ans = 0;
    while (1) {
        c = getchar();
        if (c == ' ' || c == '\n') return ans;
        ans = (ans << 3) + (ans << 1) + (c - '0');
    }
}

int main(){
    n = readInt();
    for (int i = 1; i <= n; i++) a[i] = readInt(), f[i] = max(f[i - 1], a[i]);
    dp.assign(n + 2, 0); dp2.assign(n + 2, 0);
    int ans = 0;
    for (int i = 0; i <= n + 1; i++) dp[i] = 1;
    ans += a[n];
    for (int i = 1; i < n; i++) {
        int val = min(n, f[n - i - 1] + n - i);
        for (int j = val; j >= 1; j--) {
            dp2[j] = 1LL * dp[j] * j % mod + dp[j + 1];
            if (dp2[j] >= mod) dp2[j] -= mod;
        }
        //cout << ans << " " << f[n - i - 1] << " " << dp2[f[n - i - 1]] << "\n";
        ans += 1LL * (a[n - i] - 1) * dp2[f[n - i - 1]] % mod;
        if (ans >= mod) ans -= mod;
        dp.swap(dp2);
    }

    if (ans >= mod) ans -= mod;
    printf("%d", ans);
    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