冰冻三尺 非一日之寒

摘要： Game Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1563 Accepted Submission(s): 664 Problem Des 阅读全文

摘要： Golden Eggs Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 673 Accepted Submission(s): 400 Probl 阅读全文

摘要： Alice's Chance Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 7791 Accepted: 3174 Description Alice, a charming girl, have been dreaming o 阅读全文

摘要： Machine Schedule Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 17457 Accepted: 7328 Description As we all know, machine scheduling is a v 阅读全文

摘要： Pleasant sheep and big big wolf Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3316 Accepted Sub 阅读全文

摘要： River Problem Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 721 Accepted Submission(s): 282 Pro 阅读全文

摘要： 转自神犇：https://www.cnblogs.com/jianglangcaijin/p/3799759.html 题意：申奥成功后，布布经过不懈努力，终于 成为奥组委下属公司人力资源部门的主管。布布刚上任就遇到了一个难题：为即将启动的奥运新项目招募一批短期志愿者。经过估算，这个项目需要N 天才 阅读全文

摘要： 题意： 设从1到每个点的最短距离为d，求删除几条边后仍然使1到每个点的距离为d，使得剩下的边最多为k 解析： 先求来一遍spfa，然后bfs遍历每条路，如果d[v] == d[u] + Node[i].w 则说明这条路要保留 注意是按着走的路的顺序输出的 wa1 注意最大值设为0x3f wa3 学到 阅读全文

摘要： Random Maze Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1669 Accepted Submission(s): 682 Pro 阅读全文

摘要： Mining Station on the Sea Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3565 Accepted Submissio 阅读全文