02 2014 档案

poj 2186 Popular Cows 强连通
摘要：#include#include#include#include#includeusing namespace std;const int maxn = 10000 + 10;vector G[maxn], G2[maxn];vector S;int vis[maxn], sccno[maxn], ... 阅读全文
posted @ 2014-02-08 21:52 贝尔摩德 阅读(153) 评论(0) 推荐(0)
poj1236 Network of Schools 强连通分量
摘要：#include#include#include#include#includeusing namespace std;const int maxn = 100 + 10;vector G[maxn], G2[maxn];vector S;int vis[maxn], sccno[maxn], sc... 阅读全文
posted @ 2014-02-02 12:40 贝尔摩德 阅读(153) 评论(0) 推荐(0)
hdu 1394 Minimum Inversion Number 线段树
摘要：代码出自http://www.notonlysuccess.com/index.php/segment-tree-complete/#include #include using namespace std;#define lson l , m , rt > 1; build(lson); ... 阅读全文
posted @ 2014-02-01 23:00 贝尔摩德 阅读(153) 评论(0) 推荐(0)