13974번: 파일 합치기 2 - DP(Knuth)
DP Knuth Optimization 기본 문제.#include using namespace std;typedef long long ll;typedef pair pii;typedef pair pll;typedef tuple tiii;const int INF = 1e9;const int MAXK = 5001;int K;int dp[MAXK][MAXK];int pos[MAXK][MAXK];int psum[MAXK];void solve(){ fill(&dp[0][0], &dp[MAXK-1][MAXK], INF); cin >> K; for(int i=1; i> fi; dp[i][i] = 0; pos[i][i] = i; psum[i] = psum[i-..
알고리즘/baekjoon
2024. 8. 15. 22:53
