![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
二分
清疚
这个作者很懒,什么都没留下…
展开
-
【UVA12124】Assemble
题面 Recently your team noticed that the computer you use to practice for programming contests is not good enough anymore. Therefore, you decide to buy a new computer. To make the ideal原创 2017-10-11 17:20:06 · 372 阅读 · 0 评论 -
【UVA12097】Pie
题面 My birthday is coming up and traditionally I’m serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming to my party and ea原创 2017-10-11 15:12:24 · 295 阅读 · 0 评论 -
【UVA1335】Beijing Guards
题面 Beijing was once surrounded by four rings of city walls: the Forbidden City Wall, the Imperial City Wall, the Inner City Wall, and finally the Outer City Wall. Most of these walls were demolishe原创 2017-10-11 09:27:58 · 259 阅读 · 0 评论 -
【UVA1121】Subsequence
题面 A sequence of N positive integers (10 < N < 100 000), each of them less than or equal 10000, and a positive integer S (S < 100 000 000) are given. Write a program to find the minimal length of t原创 2017-10-10 22:10:58 · 217 阅读 · 0 评论 -
【NOIP2015】运输计划
CJOJ P2430 - 【NOIP2015】运输计划题意 有一颗n个节点的树,第ii条边连接uiu_i和viv_i,边权为wiw_i。有m个任务,每个任务要从sis_i前往tit_i,花费的时间是路径上的边权之和。 现在可以选择一条边,让这条边的边权变为0,。请你求出如果选择边可以使得最大的花费时间最小化 解法 树链剖分+树上查分+线段树+二分:原创 2017-09-29 21:48:18 · 373 阅读 · 0 评论 -
【NOIP2015】 跳石头
CJOJ——P2566 - 【NOIP2015】 跳石头 题面: 这项比赛将在一条笔直的河道中进行,河道中分布着一些巨大岩石。组委会已经选择好了两块岩石作为比赛起点和终点。在起点和终点之间,有 N 块岩石(不含起点和终点的岩石)。在比赛过程中,选手们将从起点出发,每一步跳向相邻的岩石,直至到达终点。为了提高比赛难度,组委会计划移走一些岩石,使得选手们在比赛过程中的最短跳跃距离尽可能长...原创 2017-09-29 20:55:16 · 830 阅读 · 1 评论