qxdoit的博客

acwing提高班-动态规划2最长上升子序列问题友好城市#include <bits/stdc++.h>using namespace std;const int N = 5010;int dp[N];typedef pair<int, int> PP;PP a[N];int main(){ int n; scanf("%d",&n); for(int i = 0;i<n;i++)scanf("%d %d",&a[i]

acwing提高班-动态规划1从集合角度思考dp问题最低通行费#include <bits/stdc++.h>using namespace std;const int N = 105;const int INF = 1e9;int m[N][N];int dp[N][N];int main(){ int n; scanf("%d",&n); for (int i = 1; i <= n; ++i) for (in