qq_52652816的博客

Leetcode 6138. 最长理想子序列 DP+优化

Educational Codeforces Round 133 (Rated for Div. 2) Probelm D Chip Move 动态规划DP+优化

经典DP问题： #include<bits/stdc++.h> using namespace std; #define int long long int N; int w[105]; int dp[100005]; int ans; signed main() { scanf("%lld",&N); for(int i=1;i<=N;i++) cin>>w[i]; for(int i=1;i<=N;i++) for(int j=...