제출 #281269

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

teams

#include <bits/stdc++.h>

using namespace std;

int N;
int arr[10005];
int dp[10005];
int mx[10005];
const int MOD = 1000007;

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> N;
	for(int i = 1; i<=N; i++){
		cin >> arr[i];
		mx[i] = max(mx[i-1], arr[i]);
		dp[i] = 1;
	}
	long long ans = 0;
	for(int i = N; i; i--){
		ans += 1LL*min(arr[i]-1, mx[i-1]) * dp[mx[i-1]];
		for(int j = 1; j<N; j++){
			dp[j] = (1LL * j * dp[j] + dp[j+1])%MOD;
		}
		ans %= MOD;
	}
	cout << (ans+1)%MOD;
}

• 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