제출 #230105

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
230105		parsa_mobed	Calvinball championship (CEOI15_teams)	C++14	100 / 100	388 ms	504 KiB

teams

#include <bits/stdc++.h>

using namespace std;
const int N = 1e4 + 5, MOD = 1e6 + 7;
int dp[N], a[N];

int main() {
    int n, mx = 0; cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) {
        for (int j = n; j >= 2; j--) dp[j] = (1ll * dp[j] * j % MOD + dp[j - 1]) % MOD;
        dp[mx] = (dp[mx] + a[i] - 1) % MOD, mx = max(mx, a[i]);
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) ans = (ans + dp[i]) % MOD;
    cout << ans + 1 << "\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