摘要： /*用1742的方法，秒杀*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#include <iomanip>#include <bitset>#include < 阅读全文

摘要： /*动态规划限制个数的背包问题啊*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#include <iomanip>#include <bitset>#include 阅读全文

摘要： /*动态规划很笨的一种方法是 DP[i][j][k], 前i个，选j个，差是k的和最大值。这种DP比较好想，但是内存使用超大，需滚动。而且速度很慢还有一种DP,是 DP[i][j],选j个，差是k的最大值。此处遍历不是按照人的，而且按照要选几个人。此处的阶段是要选几个人内存使用也很小，速度非常快;虽然都是 N*M*801的算法，可能是我实现的不好吧*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cc 阅读全文

摘要： /*动态规划*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#include <iomanip>#include <bitset>#include <algori 阅读全文

摘要： /*动态规划，如何加速呢》？？*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#include <iomanip>#include <bitset>#include & 阅读全文

摘要： /*动态规划，半天没看明白DP[i][j] 表示前i个，i是j时的最小代价DP[i][j] = min(DP[i-1][k]+abs(j-k)*c+(j-a[i])^2) 时间复杂度是N*H*H,超时了。。。。对j,k进行分析当j>k, DP[i][j] = min(DP[i-1][k]+j*c-k*c+(j-a[i])^2) = j*c+(j-a[i])^2+min(DP[i-1][k]-k*c);当j<=k,DP[i][j] = min(DP[i-1][k]+k*c-j*c+(j-a[i])^2) = -j*c+(j-a[i])^2+min(DP[i-1][k]+k*c);领悟 阅读全文

摘要： /*DP回文字符串，添加或者删除字符使得原来的字串是回文的，并且添加删除的代价最小所谓的DP,难点在于如何找到表达状态的方式。状态出来后，转移就好弄了虽然速度不是很快*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include < 阅读全文

摘要： /*DP需要把棋盘割成n块，n>=2 && n<=14. 稍加分析，可以得出，其实求的是平方和最小写的时候确实比较繁琐。*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream&g 阅读全文

摘要： 1 /* 2 3 */ 4 5 // include file 6 #include <cstdio> 7 #include <cstdlib> 8 #include <cstring> 9 #include <cmath> 10 #include <cctype> 11 #include <ctime> 12 13 #include <iostream> 14 #include <sstream> 15 #include <fstream> 16 #include <iomani 阅读全文

摘要： /*无向图，欧拉回路或者通路的判定。*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#include <iomanip>#include <bitset>#includ 阅读全文