随笔分类 - 动态规划
摘要：点击查看代码 #include<iostream> using namespace std; const int N = 20; int n, m; int w[N][N]; int f[N][N]; int way[N]; int main() { cin >> n >> m; for (int
阅读全文
摘要：点击查看代码 #include<iostream> #include<cstring> using namespace std; const int N = 22, M = 80; int n, m, t; int f[N][M]; int main() { cin >> n >> m >> t;
阅读全文
摘要：点击查看代码 #include<iostream> using namespace std; const int N = 1010; int n, V, M; int v[N], m[N], w[N]; int f[N][N]; int main() { cin >> n >> V >> M; fo
阅读全文
摘要：点击查看代码 #include<iostream> using namespace std; const int N = 1e3 + 10; int n, m; int v[N], w[N], s[N]; int f[N]; int main() { cin >> n >> m; for (int
阅读全文
摘要：点击查看代码 #include<iostream> #include<cstring> using namespace std; const int N = 1010, M = 20010; int n, m; int v[N], w[N], s[N]; int f[M], g[M], q[M];
阅读全文
摘要：点击查看代码 #include<iostream> #include<cstring> #include<algorithm> using namespace std; const int N = 110, M = 25010; int v[N]; int f[M]; int main() { in
阅读全文
摘要：点击查看代码 #include<iostream> using namespace std; const int N = 110, M = 10010; int m; int v[4] = {10, 20, 50, 100}; int f[M]; int main() { cin >> m; f[0
阅读全文
摘要：点击查看代码 #include<iostream> using namespace std; const int N = 110, M = 10010; int n, m; int v[N]; int f[M]; int main() { cin >> n >> m; for (int i = 1;
阅读全文
摘要：点击查看代码 #include<iostream> using namespace std; const int N = 1010, M = 510; int V1, V2, n; int v1[N], v2[N]; int f[N][M]; int main() { cin >> V1 >> V2
阅读全文
摘要：点击查看代码 #include<iostream> using namespace std; const int N = 20010; int m, n; int v[N], f[N]; int main() { cin >> m >> n; for (int i = 1; i <= n; i ++
阅读全文
摘要：点击查看代码 #include<iostream> using namespace std; const int N = 1010; int m, n; int v[N], w[N]; int f[N]; int main() { cin >> m >> n; for (int i = 1; i <
阅读全文
摘要：点击查看代码 #include<iostream> using namespace std; const int N = 3010; int n; int a[N], b[N]; int f[N][N]; int main() { cin >> n; for (int i = 1; i <= n;
阅读全文
摘要：点击查看代码 #include<iostream> using namespace std; const int N = 1010; int n; int a[N], q[N], f[N]; int main() { while (cin >> a[n]) n ++; int res = 0, cn
阅读全文
摘要：点击查看代码 #include<iostream> using namespace std; const int N = 1010; int n; int a[N], f[N]; int main() { cin >> n; for (int i = 1; i <= n; i ++) cin >>
阅读全文
摘要：点击查看代码 #include<iostream> #include<algorithm> #define fi first #define se second using namespace std; const int N = 5010; int n; int f[N]; pair<int,in
阅读全文
摘要：点击查看代码 #include<iostream> using namespace std; const int N = 110; int n; int a[N], f[N], ff[N]; int main() { cin >> n; for (int i = 1; i <= n; i ++) c
阅读全文
摘要：点击查看代码 #include<iostream> using namespace std; const int N = 1010; int n; int a[N], f[N], ff[N]; int main() { cin >> n; for (int i = 1; i <= n; i ++)
阅读全文
摘要：点击查看代码 #include<iostream> using namespace std; const int N = 110; int k, n; int a[N], f[N]; int main() { cin >> k; while (k --) { cin >> n; for (int i
阅读全文
摘要：点击查看代码 #include<iostream> using namespace std; const int N = 60; int n, m; int a[N][N]; int f[2 * N][N][N]; int main() { cin >> m >> n; for (int i = 1
阅读全文
