0分求助

P1775 石子合并(弱化版)

怀疑是循环挂了,但没有找出错误原因,求调
by smqa @ 2022-10-05 14:04:15


```f[i][j]=min(f[i][j],f[i][k]+f[k+1][j]+sum[j]-sum[i-1]);```
by qlzx74lyc41 @ 2022-10-05 14:11:53


改完后为什么样例过不了?
by smqa @ 2022-10-05 14:13:37


@[alpha008](/user/569971) 三重循环整个错了 ``` for(int d=2;d<=n;d++){ for(int l=1;l<=n-d+1;l++){ int r=l+d-1; for(int i=l;i<r;i++){ dp1[l][r]=min(dp1[l][r],dp1[l][i]+dp1[i+1][r]+s[r]-s[l-1]); } } } ```
by qlzx74lyc41 @ 2022-10-05 14:14:01


可以问一下原因?
by smqa @ 2022-10-05 14:15:40


@[alpha008](/user/569971) 你的 i 表示的是长度
by WaterSun @ 2022-10-05 14:16:11


枚举长度后,枚举左端点,然后算出右端点,再枚举分开左右端点的点
by WaterSun @ 2022-10-05 14:17:34


@[SYC0226](/user/383395) 谢谢!
by smqa @ 2022-10-05 14:17:47


AC了,此帖完结!
by smqa @ 2022-10-05 14:20:11


|