满月照亮的路

#include<bits/stdc++.h> using namespace std; #define rep(x,y,z) for(int (x)=(y);(x)<(z);x++) #define mst(x,y) memset(x,y,sizeof(x)) #define ll long long #define pii pair<int,int> #def...

#include<bits/stdc++.h> using namespace std; #define rep(x,y,z) for(int (x)=(y);(x)<(z);x++) #define mst(x,y) memset(x,y,sizeof(x)) #define ll long long #define pii pair<int,int> #def...

Problem B. Harvest of Apples Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 2073    Accepted Submission(s): 804   Problem Description The...

项目管理 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3664    Accepted Submission(s): 1367   Problem Description 我们建造了一个大项目！这个项目有n个节点，用很多边连接起...

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5213 #include&lt;bits/stdc++.h&gt; using namespace std; #define debug puts("YES"); #define rep(x,y,z) for(int (x)=(y);(x)&lt;(z);(x)++) #define read(x,...

题目链接：acm.hdu.edu.cn/showproblem.php?pid=4467 #include&lt;bits/stdc++.h&gt; using namespace std; #define debug puts("YES"); #define rep(x,y,z) for(int (x)=(y);(x)&lt;(z);(x)++) #define read(x,y) sca...

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5145 #include&lt;bits/stdc++.h&gt; using namespace std; #define debug puts("YES"); #define rep(x,y,z) for(int (x)=(y);(x)&lt;(z);(x)++) #define read(x...