Coldfresh的博客

After World War X, a lot of cities have been seriously damaged, and we need to rebuild those cities. However, some materials needed can only be produced in certain places. So we need to transport these

Give you a sequence of N(N≤100,000)integers : a1,…,an(0#include<cstdio> #include<iostream> #include<queue> #include<cstring> #include<vector> #include<algorithm> #include<cmath> #include<map> #define N

Connected undirected weighted graph without self-loops and multiple edges is given. Graph contains n vertices and m edges. For each edge (u, v) find the minimal possible weight of the spanning tree t...