摘要：
这个题网上很多人都说用状态压缩dp来做，我就是觉得状态压缩dp有点那么理解不上啊，不过如果这个题吧相邻的两个格子连起来，那不就是求最大权独立点集吗？奋战了三天，我的第一道最大流题目终于写出来了，高兴啊！#include#include#include#include#include#include#... 阅读全文
摘要：
Problem DescriptionIgnatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline o... 阅读全文
摘要：
简单最小生成树，继续我的kruskal#include#include#include#includeusing namespace std;const int MAX=1000000;struct node{ int left,right,cost;}road[MAX];bool cmp(n... 阅读全文
摘要：
又是一道简单并查集#include#include#include#include#include#include#include#include#include#include#include#define inf 0x0f0f0f0fusing namespace std;const doub... 阅读全文
摘要：
简单并查集#include#include#include#include#include#include#include#include#include#include#include#define inf 0x0f0f0f0fusing namespace std;const double p... 阅读全文
摘要：
DescriptionOn a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vert... 阅读全文
摘要：
DescriptionFarmer John completed his new barn just last week, complete with all the latest milking technology. Unfortunately, due to engineering probl... 阅读全文
摘要：
Problem F Solve It Input: standard input Output: standard output Time Limit: 1 second Memory Limit: 32 MB Solve the equation: p*e-x + q*sin(x) + r*co... 阅读全文
摘要：
Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and... 阅读全文
摘要：
题目描述Little John is playing very funny game with his younger brother. There is one big box filled with M&Ms of different colors. At first John has to e... 阅读全文