Zengtudor/ProgramAlgTrain
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

update

Browse Source
This commit is contained in:
Zengtudor 2024-09-19 11:25:26 +08:00
parent a926d878d1
commit 513f21c1cf
2 changed files with 8 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
20240919/CSP常考算法模板/区间dp/区间dp_合并石子.cpp
View File

@ -5,6 +5,7 @@ int a[101];
int sum[101]; // prefix sum int sum[101]; // prefix sum
int f[101][101]; int f[101][101];
/* /*
区间动态规划解题步骤： 区间动态规划解题步骤：
1.根据问题推测dp[i][j]的含义 1.根据问题推测dp[i][j]的含义
问题是：把第1堆到第n堆石子合成一堆，最小的得分 问题是：把第1堆到第n堆石子合成一堆，最小的得分

BIN
out.txt
View File

Binary file not shown.