제출 #82349

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
82349		aminra	Calvinball championship (CEOI15_teams)	C++14	100 / 100	742 ms	1092 KiB

teams

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double ld;
const int MOD = 1000007;
const int base = 37;
const int MAXN = (int)1e4 + 7;
const int infint = (int)1e9;
const ll inf = (ll)1e18;
ll n, a[MAXN], dp[MAXN], tmp[MAXN], mx[MAXN];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> a[i];
	mx[0] = a[0];
	for (int i = 1; i < n; i++)
		mx[i] = max(mx[i - 1], a[i]);
	for (int i = 0; i <= n; i++)
		dp[i] = 1;
	ll ans = a[n - 1] - 1;
	for (int i = n - 2; i >= 0; i--)
	{
		for (int j = 0; j <= n; j++)
			tmp[j] = (j * dp[j] % MOD + dp[j + 1]) % MOD;
		for (int j = 0; j <= n; j++)
			dp[j] = tmp[j];
		for (int k = 1; k < a[i]; k++)
		{
			ll t = k;
			if(i)
				t = max(t, mx[i - 1]);
			ans += dp[t], 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