skyline

这题不难~但Bug找了很久，发现~~if后面加了个分号~~汗 #include #include #include #include using namespace std; int parent[105]; int count1; struct node { int u;int v; int w; node():u(0),v(0),w(0){} }; int

http://acm.hdu.edu.cn/showproblem.php?pid=3371 此题用g++超时c++就过了，求解~~~~ 以下代码： #include #include #include #include using namespace std; struct edge { int u,v; int s; edge():u(0),v(0),

#include #include #include #include #include using namespace std; int p[105]; int rank[105],x[105],y[105]; struct node { int u,v; double s; node():u(0),v(0),s(0){} }; bool cmp(const n

查并集 在hdu过不了~~pku过了 #include #include #include using namespace std; int p[100005]; int vis[100005]; void make_set(int i) { p[i]=i; } int find_set(int i) { int j=i; if(j!=p[j]) {

对特殊情况总是考虑不周~~~当n=0应输出1; http://acm.hdu.edu.cn/showproblem.php?pid=1856 #include #include #include using namespace std; int p[10000005]; int vis[10000005]; int maxx; inline void make_set(int n

Farm Irrigation Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3496    Accepted Submission(s): 1544 Problem Description Benny has

find the most comfortable road Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1906    Accepted Submission(s): 802 Problem Description