AC_hunter的博客

链接：https://www.nowcoder.com/acm/contest/104/C来源：牛客网题目描述 Who killed Cock Robin? I, said the Sparrow, With my bow and arrow,I killed Cock Robin. Who saw him die? I, said the F...

DescriptionA multi-digit column addition is a formula on adding two integers written like this:A multi-digit column addition is written on the blackboard, but the sum is not necessarily correct. We ca...

题意：你经营着一家披萨店，该披萨店在1号点，每天都会有很多的订单，第i个订单是在si时刻发来的，收货地点在ui，该披萨在ti时刻才可以做好。问你每个订单的收货时间-发出时间（即买家等待时间）的最大值 的最小值 是多少。 即用dp[i]表示第i个订单，让你最小化 Max{dp[i]-s[i]}。 数据输入： 第一行：n(点的数目,n<=1000),m(边的数目,m<=5000...