eeeaaaaa的专栏

Delay Constrained Maximum Capacity Path Time Limit: 10000/10000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 969 Accepted Submission(s): 301 Problem Descr

Countries in War Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 2314 Accepted: 721 Description In the year 2050, after different attempts of the UN to maintain peace in the world, th

find the longest of the shortest Time Limit: 1000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1560    Accepted Submission(s): 557 Problem Descripti

Warfare And Logistics Time Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu [Submit] [Go Back] [Status]  Description Download as PDF The army of United Nations launched a new

链接：HDU1531

House Man Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2056 Accepted Submission(s): 811 Problem Description In Fuzhou, there is a c

Cashier Employment Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 858 Accepted Submission(s): 367 Problem Description A supermarket i

题意：给出一张图，要求从1点开始跑最短路，并以1为根生产一棵最短路树（长度相同找到字典序最小的），然后求出这个树上恰好经过k个点的最长路径，并输出数量。 从1点跑一遍最短路，然后dfs生产最短路生成树，然后点分治，找到重心之后对重心每条边算一次经过了i个点的最长路，然后还要用数组记录一下前面经过了i个点的最长路。。处理方法在讲点分治的论文上有。 #include #include #inclu