diff options
| author | mzuenni <michi.zuendorf@gmail.com> | 2022-06-27 17:19:28 +0200 |
|---|---|---|
| committer | mzuenni <michi.zuendorf@gmail.com> | 2022-06-27 17:19:28 +0200 |
| commit | 5ab8a5088b729a9953b8dff1b2a985dc8fb2098b (patch) | |
| tree | ed40d6936c0e9eee40ba62751cbf99ecddbaddc2 /other/divideAndConquer.cpp | |
| parent | adabbad9c51cf7cd3874bfde8eac1fbcf84fec10 (diff) | |
updated tcr
Diffstat (limited to 'other/divideAndConquer.cpp')
| -rw-r--r-- | other/divideAndConquer.cpp | 27 |
1 files changed, 27 insertions, 0 deletions
diff --git a/other/divideAndConquer.cpp b/other/divideAndConquer.cpp new file mode 100644 index 0000000..92ec0ef --- /dev/null +++ b/other/divideAndConquer.cpp @@ -0,0 +1,27 @@ +vector<vector<ll>> dp; +vector<vector<ll>> C; + +void rec(int i, int j0, int j1, int k0, int k1) { + if (j1 < j0) return; + int jmid = (j0 + j1) / 2; + + dp[i][jmid] = inf; + int bestk = k0; + for (int k = k0; k < min(jmid, k1 + 1); ++k) { + if (dp[i - 1][k] + C[k + 1][jmid] < dp[i][jmid]) { + dp[i][jmid] = dp[i - 1][k] + C[k + 1][jmid]; + bestk = k; + }} + + rec(i, j0, jmid - 1, k0, bestk); + rec(i, jmid + 1, j1, bestk, k1); +} + +ll calc(int n, int k) { + dp = vector<vector<ll>>(k, vector<ll>(n, inf)); + for (int i = 0; i < n; i++) dp[0][i] = C[0][i]; + for (int i = 1; i < k; i++) { + rec(i, 0, n - 1, 0, n - 1); + } + return dp[k - 1][n - 1]; +} |
