제출 #527151

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
527151		joelau	Calvinball championship (CEOI15_teams)	C++14	70 / 100	881 ms	65540 KiB

teams

#include <bits/stdc++.h>
using namespace std;

long long N, A[10005], p = 1000007;
map<long long,long long> mp[10005];

long long dp (long long n, long long m) {
    if (n == N+1) return 1;
    if (mp[n].find(m) != mp[n].end()) return mp[n][m];
    return mp[n][m] = (dp(n+1,m) * m + dp(n+1,m+1)) % p;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin >> N;
    for (long long i = 1; i <= N; ++i) cin >> A[i];
    long long ans = 1, most = 0;
    for (long long i = 1; i <= N; ++i) {
        ans = (ans + dp(i+1,most) * min(most,A[i]-1)) % p;
        for (long long j = most+1; j < A[i]; ++j) ans = (ans + dp(i+1,j)) % p;
        most = max(most,A[i]);
    }
    cout << 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: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10