Submission #48443

#	Time	Username	Problem	Language	Result	Execution time	Memory
48443		IvanC	Calvinball championship (CEOI15_teams)	C++17	70 / 100	704 ms	8784 KiB

teams

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

typedef long long ll;
const int MAXN = 1010;
const ll MOD =  1000007LL;

ll dp[MAXN][MAXN],tot;
int N,vetor[MAXN];

ll solve(int pos,int maior){
	if(dp[pos][maior] != -1) return dp[pos][maior];
	if(pos == N + 1){
		return dp[pos][maior] = 1;
	}
	ll ans = 0;
	for(int i = 1;i<maior;i++){
		ans += solve(pos+1,maior);
	}
	ans += solve(pos+1,maior+1);
	return dp[pos][maior] = ans % MOD;
}

int main(){
	cin >> N;
	for(int i = 1;i<=N;i++) cin >> vetor[i];
	memset(dp,-1,sizeof(dp));
	int maior = 0;
	for(int i = 1;i<=N;i++){
		for(int j = 1;j<vetor[i];j++){
			tot += solve(i+1,max(j,maior) + 1);
		}
		maior = max(maior,vetor[i]);
		tot %= MOD;
	}
	tot++;
	tot %= MOD;
	cout << tot << endl;
	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