HDU_3681
由于Y和G加起来不到15个，那么可以预先将F、Y、G之间的最短路处理出来，然后化归成TSP问题来做。
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<queue>
#define MAXD 20
int N, M, dis[MAXD][MA
题解：数据结构来优化网络流，貌似都是用一段区间来表示一个点，然后各种乱搞。。。发现主席树好吊。。。在树上建主席树貌似有三种方法：1.建每个点到根节点这条链上的主席树，可以回答和两点间的路径的XX问题。2.按DFS序然后就成了序列上的主席树，可以回答子树第k大等XX问题。3.先给每个点单独建立主席树，... Read More
Problem Description
Rompire is a robot kingdom and a lot of robots live there peacefully. But one day, the king of Rompire was captured by human beings. His thinking circuit was changed by human an
I am starting this Blog to record my steps on IT learning,hoping this could be helpful.It has been a long time since last time I wrote something seriousely, actually I have no idea how to write
