博客搬家啦

/*problem: 最长公共子序列*/ #include #include #include #include using namespace std; const int maxn = 1005; int dp[maxn][maxn]; int main() { string str1, str2; while (cin >> str1 >> str2) { memset

#include #include #include #include #include using namespace std; const int maxn = 100005; int dp[maxn], g[maxn]; struct node { int spos, epos; }; node q[maxn]; int main() { int cas, t = 0,

/*problem: 多重背包*/ #include #include #include using namespace std; const int maxn = 105; int dp[maxn], cost[maxn], value[maxn], Count[maxn]; int v, n; void ZeroOnePack(int C, int V) { for (int

/*problem: 多重背包*/ #include #include #include using namespace std; const int maxn = 100005; int dp[maxn], cost[25], value[25]; int main() { int cas, n, v, y, ans; cin >> cas; while (cas--) {

/*problem: 最长不下降子序列*/ #include #include #include using namespace std; int main() { int n, cas = 0; vector v, f; while (cin >> n && n != -1) { v.push_back(n); while (cin >> n && n != -1) {

/*problem: 完全背包*/ #include #include #include using namespace std; const int maxn = 10005; int dp[maxn]; int cost[1005], value[1005]; int main() { int cas, e, f, v, n; cin >> cas; while (cas--

#include #include using namespace std; const int maxn = 105; int main() { int g[maxn][maxn], N; while (cin >> N) { for (int i = 0; i < N; ++i) { for (int j = 0; j <= i; ++j) cin >> g[i

/*algorithm: 01背包*/ #include #include #include using namespace std; const int maxn = 15000; int w[maxn], v[maxn], dp[maxn]; int main() { int n, m, ans; while (cin >> n >> m) { memset(dp, 0,