码迷,mamicode.com
首页 >  
搜索关键字:jungle roads    ( 729个结果
UVALive 4992 Jungle Outpost(半平面交)
题意:给你n个塔(点)形成一个顺时针的凸包,敌人可以摧毁任何塔,摧毁后剩下的塔再组成凸包 在开始的凸包内选一点为主塔,保证敌人摧毁尽量多塔时主塔都还在现在的凸包内,求出最多摧毁的塔 题解:这题关键就是选的主塔在不同的地方,敌人就会摧毁不同的塔来让你的主塔暴露 因此这样想,找出敌人摧毁不同的塔后形成的 ...
分类:其他好文   时间:2017-01-15 07:22:02    阅读次数:265
[kuangbin带你飞]专题六 最小生成树 POJ 2421 Constructing Roads
给一个n个点的完全图 再给你m条道路已经修好 问你还需要修多长的路才能让所有村子互通 将给的m个点的路重新加权值为零的边到边集里 然后求最小生成树 ...
分类:其他好文   时间:2017-01-10 21:03:03    阅读次数:233
sicily1024 Magic Island(图的遍历)
Description There are N cities and N-1 roads in Magic-Island. You can go from one city to any other. One road only connects two cities. One day, The k ...
分类:其他好文   时间:2017-01-07 20:38:37    阅读次数:164
codeforces E. Famil Door and Roads 期望
一棵树,n个节点,边长为1,有q个询问,每个询问给出u,v(u != v),问在树上等概率加一条边,如果使得u,v在一个环内,则这种加边方式是合法的,此时的值为环的长度,所有合法的加边方式出现的概率相等,问值的期望。 2 <= n,m <= 10^5 对于u,v原来路径上的边一定在环内,贡献为1,新 ...
分类:其他好文   时间:2017-01-05 22:34:19    阅读次数:266
HDU--1301--Jungle Roads(最小生成树)
Problem Description The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between vi... ...
分类:其他好文   时间:2016-12-30 01:51:53    阅读次数:186
HDU1102--Constructing Roads(最小生成树)
Problem Description There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to ...
分类:其他好文   时间:2016-12-29 23:19:11    阅读次数:227
openjudge ROADS
726:ROADS 726:ROADS 总时间限制:1000ms内存限制:65536kB描述N cities named with numbers 1 ... N are connected with one-way roads. Each road has two parameters assoc ...
分类:其他好文   时间:2016-12-24 20:50:48    阅读次数:196
Constructing Roads(最小生成树)
Constructing Roads Problem Description There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villa ...
分类:其他好文   时间:2016-12-07 23:42:45    阅读次数:197
BZOJ 1123: [POI2008]BLO
1123: [POI2008]BLO Description Byteotia城市有n个 towns m条双向roads. 每条 road 连接 两个不同的 towns ,没有重复的road. 所有towns连通。 Byteotia城市有n个 towns m条双向roads. 每条 road 连接 ...
分类:其他好文   时间:2016-11-23 07:28:16    阅读次数:193
BZOJ 1116: [POI2008]CLO
1116: [POI2008]CLO Description Byteotia城市有n个 towns m条双向roads. 每条 road 连接 两个不同的 towns ,没有重复的road. 你要把其中一些road变成单向边使得:每个town都有且只有一个入度 Byteotia城市有n个 town ...
分类:其他好文   时间:2016-11-23 07:18:25    阅读次数:149
729条   上一页 1 ... 28 29 30 31 32 ... 73 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!