mirror of
https://gitcode.com/Zengtudor/alg2025.git
synced 2025-09-05 17:50:36 +00:00
Zengtudor
2573240c73
添加算法笔记标题到README.md 新增两个动态规划算法模板文件： - opj8782.cpp：处理数字串添加乘号的最大值问题 - P4342.cpp：处理区间合并的最大最小值问题
21 lines
229 B
C++
21 lines
229 B
C++
/*
|
|
|
|
dp[i][j]=前i个数字添加j个乘号的最大值
|
|
dp[i][j]=max(
|
|
dp[i][j],
|
|
dp[k][j-1] * num[k+1][i]
|
|
)
|
|
|
|
num[i][i]=n[i]-'0'
|
|
num[i][j]=num[i][j-1]*10+(n[j]-'0')
|
|
|
|
dp[i][j] = -1e9
|
|
dp[i][0] = num[1][i]
|
|
|
|
*/
|
|
|
|
|
|
int main(){
|
|
|
|
}
|