摘要：
覆盖的面积 Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7351 Accepted Submission(s): 3701 Problem 阅读全文
摘要：
约会安排 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 2637 Accepted Submission(s): 732 Problem De 阅读全文
摘要：
Vases and Flowers Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 4506 Accepted Submission(s): 1 阅读全文
摘要：
Assign the task Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5032 Accepted Submission(s): 196 阅读全文
摘要：
Mayor's posters Time Limit: 1000MS Memory Limit: 65536K Total Submissions:75394 Accepted: 21747 Description The citizens of Bytetown, AB, could not st 阅读全文
摘要：
A very brave explorer Petya once decided to explore Paris catacombs. Since Petya is not really experienced, his exploration is just walking through th 阅读全文
摘要：
E. Tree Constructing E. Tree Constructing You are given three integers nn, dd and kk. Your task is to construct an undirected tree on nn vertices with 阅读全文
摘要：
#include #include using namespace std; struct node { int num; char name[50]; int score; }; //201755555555 int main() { mapmp[500]; mp[55][201755555555]=node{20147,"sds",45}; c... 阅读全文
摘要：
如果在一个不存在回路的有向图中，找到一条从源点到汇点路径，长度为w。如果在该图中，还能找到一条比之更长的路径，那么，在长度为w的路径中，一定存在某个位置，可以稍作等待，所以，关键路径一定是最长路径，同理，最长路径一定是关键路径。 在这个逻辑之中，存在以下问题，为什么，在长度为w的路径中，一定存在某个 阅读全文
摘要：
#include #include #include using namespace std; int num[100]; int main() { queueq; queueans; int n,m; cin>>n>>m; int x,y; vectoru[100]; for(int i=1;i>x>>y; u[x].pu... 阅读全文