Submission #363645

#	Time	Username	Problem	Language	Result	Execution time	Memory
363645		silverfish	Holiday (IOI14_holiday)	C++14	0 / 100	5049 ms	26092 KiB

holiday

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


long long dp[3002][3002];

long long int findMaxAttraction(int n, int start, int d, int a[]) {

	//dp[i][j] : best score if i visit city i on the jth day
	if(d==0) return 0;
	dp[start][1] = a[1];
	long long ans = a[1];
	for(int j = 2; j <= d; ++j){
		for(int i = 0; i < n; ++i){
			dp[i][j] = 0;
			for(int k = 1; k < n; ++k){
				if(j-k-1 >= 1){
					if(i-k >= 0)
						dp[i][j] = max(dp[i][j], a[i] + dp[i-k][j-k-1]);
					if(i+k < n)
						dp[i][j] = max(dp[i][j], a[i] + dp[i+k][j-k-1]);
				}
			}
			ans = max(ans, dp[i][j]);
		}
	}
	return ans;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 23
• Subtask 3: 0 / 17
• Subtask 4: 0 / 53