SPOJ
绝尘花遗落
一骑红尘妃子笑,无人知是荔枝来
展开
-
OPTM-Optimal Marks-SPOJ839最小割
You are given an undirected graph G(V, E). Each vertex has a mark which is an integer from the range [0..231 – 1]. Different vertexes may have the same mark.For an edge (u, v), we define Cost(u, v) = m原创 2016-02-26 11:42:14 · 2084 阅读 · 0 评论 -
【SPOJ375】 Query on a tree——树链剖分
You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3…N-1.We will ask you to perfrom some instructions of the following form:CHANGE i ti : change the cos原创 2016-03-20 19:49:56 · 448 阅读 · 0 评论 -
【SPOJ PGCD】Primes in GCD Table——莫比乌斯反演2
PGCD - Primes in GCD TableJohnny has created a table which encodes the results of some operation – a function of two arguments. But instead of a boring multiplication table of the sort you learn by hea原创 2016-05-12 10:55:41 · 637 阅读 · 0 评论 -
【SPOJ VLATTICE】Visible Lattice Points——莫比乌斯反演3
Consider a N*N*N lattice. One corner is at (0,0,0) and the opposite one is at (N,N,N). How many lattice points are visible from corner at (0,0,0) ? A point X is visible from point Y iff no other lattic原创 2016-05-12 14:07:45 · 516 阅读 · 0 评论