码迷,mamicode.com
首页 >  
搜索关键字:ural 1090    ( 1009个结果
URAL 1515. Cashmaster (数学啊 )
URAL 1515. Cashmaster (数学啊 )...
分类:其他好文   时间:2015-02-07 20:27:24    阅读次数:245
URAL 1491. Unreal Story(区间染色, 数学啊)
URAL 1491. Unreal Story(区间染色, 数学啊)...
分类:其他好文   时间:2015-02-07 20:25:30    阅读次数:134
URAL 1572. Yekaterinozavodsk Great Well(数学啊)
URAL 1572. Yekaterinozavodsk Great Well(数学啊)...
分类:其他好文   时间:2015-02-07 20:23:43    阅读次数:143
ural 1009. K-based Numbers dp 高精度
点击打开链接 1009. K-based Numbers Time limit: 1.0 second Memory limit: 64 MB Let’s consider K-based numbers, containing exactly N digits. We define a number to be valid if itsK-based ...
分类:其他好文   时间:2015-02-07 13:14:20    阅读次数:142
ural 1018 Binary Apple Tree
1018. Binary Apple Tree Time limit: 1.0 second Memory limit: 64 MB Let's imagine how apple tree looks in binary computer world. You're right, it looks just like a binary tree, i.e. any biparous b...
分类:移动开发   时间:2015-02-06 09:36:29    阅读次数:231
ural 1039 Anniversary Party
1039. Anniversary Party Time limit: 0.5 second Memory limit: 8 MB Background The president of the Ural State University is going to make an 80'th Anniversary party. The university has a hierarch...
分类:其他好文   时间:2015-02-06 09:34:06    阅读次数:116
ural 1039 Anniversary Party
1039. Anniversary PartyTime limit: 0.5 secondMemory limit: 8 MBBackgroundThe president of the Ural State University is going to make an 80'th Annivers...
分类:其他好文   时间:2015-02-06 00:35:48    阅读次数:222
ural 1018 Binary Apple Tree
1018. Binary Apple TreeTime limit: 1.0 secondMemory limit: 64 MBLet's imagine how apple tree looks in binary computer world. You're right, it looks ju...
分类:移动开发   时间:2015-02-05 23:14:29    阅读次数:275
1380 没有上司的舞会
1380 没有上司的舞会时间限制: 1 s空间限制: 128000 KB题目等级 : 钻石 Diamond题解题目描述Description Ural大学有N个职员,编号为1~N。他们有从属关系,也就是说他们的关系就像一棵以校长为根的树,父结点就是子结点的直接上司。每个职员有一个快乐指数。现在有.....
分类:其他好文   时间:2015-02-04 23:17:12    阅读次数:198
Ural 1277 cops ans thieves (最小割模型)
题目地址 :http://acm.timus.ru/problem.aspx?space=1&num=1277 这里我们要拆点。把一个点拆成i,i' 。如何 i,j有边 ,在建边(i,j',inf),(j,i',inf)。 然后每个点点边(i',i,R[i])。这样建边以后,若要阻止 s到f的路径,那么必须破败一些边,那么我们为了是的边权最小,必须破坏边权小于inf的边,对应的就是图中拆点后的边...
分类:其他好文   时间:2015-02-04 16:35:03    阅读次数:195
1009条   上一页 1 ... 78 79 80 81 82 ... 101 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!