제출 #363643

#제출 시각아이디문제언어결과실행 시간메모리
363643silverfish휴가 (IOI14_holiday)C++14
0 / 100
5090 ms25836 KiB
#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 dp[start][1] = 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]); } } } } long long ans = 0; for(int i = 0; i < n; ++i) ans = max(ans, dp[i][d]); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...