qq_41854014的博客

区间dp#include<bits/stdc++.h>using namespace std;int main(int argc, char const *argv[]){ int n; cin >> n; int a[305], sum[305]; for (int i = 1; i <= n; ++i) { cin >> a[i]; sum[i] += sum[i-1] + a[i]; } int dp[305][305];

刚开始学习动态规划,参考了别人的思路~链接: https://blog.youkuaiyun.com/lin_ty/article/details/89040469.1.边界条件2.最优子结构3.状态转移方程#include<bits/stdc++.h>using namespace std;const int maxn = 1005;int main(int argc, char const *argv[]){ int t; cin >> t; while(t--)