摘要：
/*maybe DP can solve it状态DP问题，计数利用状态DP求最优hamilton回路这个问题可以分成两问，一个求hamilton回路的最大值，还有一个是这种最大值的路径有几个,前者很明显的DP,后者是DP上的计数*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#incl 阅读全文
摘要：
/*多重背包发现一个小规律，所有的相同类型的物品必须放在一起，这样可以对物品类型拍个序，按照不能超过的高度排序*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#include <ioma 阅读全文
摘要：
/*和2182很相似，不过这里要把对应的ID输出*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#include <iomanip>#include <bitset># 阅读全文
摘要：
/*我这种排序的方法是不对的：反例，0 1 0 1 0，最佳答案是 4 5 2 3 1 正确的方法是从后往前，每次都拿出当前数组的第K大数*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#in 阅读全文
摘要：
/*可二维线段树解决对于区间更新，区间查询的问题，似乎树状数组不好做这样硬用树状数组，似乎不太好吧*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#include <iomanip> 阅读全文