xiaoyu1_1的专栏

http://www.2cto.com/kf/201308/236512.html http://blog.youkuaiyun.com/catalyst1314/article/details/19008903 #include #include #include #include #include #include #include #include using namespace s

http://blog.youkuaiyun.com/catalyst1314/article/details/19015401 http://blog.youkuaiyun.com/z309241990/article/details/8742321 #include #include #include #include using namespace std; int e[220],s[220],c

http://blog.youkuaiyun.com/dyx404514/article/details/15506601 http://blog.youkuaiyun.com/catalyst1314/article/details/19012251 链接里看的思路，然后写了一下午，晚上改了2个BUG.... #include #include #include #include using namespac

呵呵，思路清晰爆了，瞬写 #include #include #include #include using namespace std; char ch[100]; int map[16][16]; int s[10000],c[16][10000]; int dp[16][10000]; int n; int count(int h,int x) { int i,sum=0; for(

状态压缩dp.. #include #include #include #include #include using namespace std; #define inf 0x3f3f3f3f struct node { int d,c; char ch[110]; }p[20]; int n; bool cmp(node a,node b) { return strcmp(a.ch,

D. Roman and Numbers time limit per test 4 seconds memory limit per test 512 megabytes input standard input output standard output Roman is a young mathematician, very f