e2hang/Data-Structure
1
1
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

DP-Algo

Browse Source
This commit is contained in:
e2hang
2025-09-15 22:16:09 +08:00
parent eea1a643fb
commit e9519e8558
19 changed files with 513 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

38
Algorithm/DP-DynamicProgramming/Linear-DP/Interval-DP/UVa10003CuttingSticks.cpp Normal file
View File

@@ -0,0 +1,38 @@
#include <iostream>
#include <vector>
using namespace std;
int main(){
int len, n;
cin >> len >> n;
vector<int> a(n + 2);
vector<vector<int>> dp(n + 2, vector<int>(n + 2, 0));
//<2F><><EFBFBD><EFBFBD>dp[i][j]Ϊ<>и<EFBFBD>ľ<EFBFBD><C4BE>[i, j]<5D><> 0|---1|-----2|----3|--4| <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ķ<EFBFBD><C4B7><EFBFBD> a[0] = 0 a[1] = x,,, a[n + 1] = len
a[0] = 0; a[n + 1] = len;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
//a[i]<5D>Ƿֵ<C7B7>
/*<2A><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
for(int i = 0; i <= n + 1; i++){
for(int j = i; j <= n + 1 ;j++){
dp[i][j] = 114514;
for(int k = i + 1; k < j; k++){
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j] + a[j] - a[i]);
}
if(dp[i][j] == 114514) dp[i][j] = 0;
}
} */
// <20><><EFBFBD><EFBFBD> DP<44><50><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȵ<EFBFBD><C8B5><EFBFBD>
for(int l = 2; l <= n + 1; l++){ // <20><><EFBFBD>䳤<EFBFBD><E4B3A4><EFBFBD><EFBFBD><EFBFBD><EFBFBD>2
for(int i = 0; i + l <= n + 1; i++){
int j = i + l;
dp[i][j] = INT_MAX;
for(int k = i + 1; k < j; k++){
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j] + a[j] - a[i]);
}
if(dp[i][j] == INT_MAX) dp[i][j] = 0;
}
}
cout << dp[0][n + 1] << endl;
return 0;
}