utoppia is another word .

题目描述：122. The booktime limit per test: 0.5 sec. memory limit per test: 4096 KBThere is a group of N (2<=N<=1000) people which are numbered 1 through N, and everyone of them has not les

题目描述：                                    101. Domino                                                              time limit per test: 0.5 sec.

题目描述：103. Traffic LightsTime limit per test: 0.5 second(s)Memory limit: 4096 kilobytesinput: standardoutput: standardIn the city of Dingilville the traffic is arranged in an un

172. eXamtime limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standardoutput: standardIn Russia school pupils must do some exams before leaving school. Among others, t

194. Reactor Coolingtime limit per test: 1 sec.memory limit per test: 65536 KBinput: standardoutput: standardThe terrorist group leaded by a well known international terrorist Ben

#include#include#include#include#includeusing namespace std;int const nMax = 310;int const oo = 0x7fffffff;int first[nMax],now[nMax],f[nMax*nMax],to[nMax*nMax],nxt[nMax*nMax];int n,m,e;in

hdu3594典型的Tarjan 算法，代码如下：#include#include#includeusing namespace std;int const nMax = 20010;int const maxm = 50010*2;int first[nMax],to[maxm],nxt[maxm],dfn[nMax],low[nMax],vis[nMax];int n,

POJ 3710 Christmas Game图的删边游戏：由于这个图比较特殊，我们推出如果环是奇环，则相当于加一条边，偶数环就相当于删除环，变成一个点。不会缩环的默默YY了一个多小时才勉强搞定。#include#include#include#include#include#include#include#include#includeusing na

最短路神马的最有意思。。。/************************************************************************* > File Name: 1210.cpp > Author: utoppia > Mail: utoppia@163.com > Created Time: 2013/12/20 9:

int first[nMax],nxt[nMax],to[nMax],e;void addadge(int u,int v) { to[e]=v;nxt[e]=first[u];first[u]=e;e++; to[e]=u;nxt[e]=first[v];first[v]=e;e++;}int low[nMax],dfn[nMax],dep,belong[nMax],vis