A.SoldierandBananas模拟[crayon-687febe88302c488888604/]B.SoldierandBadges排序[crayon-687febe883034131764099/]C.SoldierandCards暴力模拟个一百万次。。。[crayon-687febe883039838803765/]D.SoldierandNumberGame用筛法得出每个数质因子个数前缀和即可[crayon-687febe88303c733611661/]E.SoldierandTraveling我比较愚蠢写了网络流。。正解是什么我不知道[crayon-687febe883041688160640/] ...
1966.CableTVNetwork枚举源汇求最小割[crayon-687febe883a11036088229/]2386.LakeCounting搜索[crayon-687febe883a1d415629040/]3863.BusinessCenter枚举每个电梯,二分求最小值[crayon-687febe883a23822096624/]2504.Boundingbox求外心然后旋转n次得到多边形坐标精度弃坑。。[crayon-687febe883a42100715405/]3155.HardLife最大密度子图+方案分数规划[crayon-687febe883a4a400722029/]4028.GCDGuessingGame贪心策...
Description给一列数,要求支持操作:1.修改某个数的值2.读入l,r,k,询问在[l,r]内选不相交的不超过k个子段,最大的和是多少。InputThefirstlinecontainsintegern(1 ≤ n ≤ 105),showinghowmanynumbersthesequencehas.Thenextlinecontainsnintegersa1, a2, ..., an(|ai| ≤ 500).Thethirdlinecontainsintegerm(1 ≤ m ≤ 105)—thenumberofqueries.Thenextmlinescontainthequeriesintheformat,giveninthestate...
近期评论