码迷,mamicode.com
首页 >  
搜索关键字:Description    ( 34858个结果
Is It A Tree?------HDOJ杭电1325(两种方法,可以用也可以不用并查集!!!!!!详解)
Problem Description A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the follow...
分类:其他好文   时间:2014-05-21 10:55:57    阅读次数:325
hdu 1171 Big Event in HDU 多重背包
Big Event in HDU Problem Description Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever been split into Comp...
分类:其他好文   时间:2014-05-21 10:51:55    阅读次数:300
bzoj 2506 calc 题解
【原题】 2506: calc Time Limit: 10 Sec  Memory Limit: 256 MB Submit: 228  Solved: 112 Description            给一个长度为n的非负整数序列A1,A2,…,An。现有m个询问,每次询问给出l,r,p,k,问满足l Input          第一行两个正整...
分类:其他好文   时间:2014-05-21 10:38:18    阅读次数:267
poj 3735 Training little cats(矩阵快速幂)
Description Facer's pet cat just gave birth to a brood of little cats. Having considered the health of those lovely cats, Facer decides to make the cats to do some exercises. Facer has well designe...
分类:其他好文   时间:2014-05-21 10:36:57    阅读次数:297
hdu 1114 Piggy-Bank -- 完全背包
Piggy-Bank Problem Description Before ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound M...
分类:其他好文   时间:2014-05-21 10:17:35    阅读次数:289
HDU FATE (完全背包+有限取次)(二重费用背包)
FATE Problem Description 最近xhd正在玩一款叫做FATE的游戏,为了得到极品装备,xhd在不停的杀怪做任务。久而久之xhd开始对杀怪产...
分类:其他好文   时间:2014-05-21 10:16:18    阅读次数:194
poj 3070 Fibonacci(矩阵快速幂)
Description In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn ? 1 + Fn ? 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are: 0, 1, 1, 2, 3, 5, 8, 13, 21, ...
分类:其他好文   时间:2014-05-21 09:39:15    阅读次数:231
POJ 2677(双调旅行商问题<bictonicTSP>
Tour Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3470 Accepted: 1545 Description John Doe, a skilled pilot, enjoys traveling. While on vacation, he rents a...
分类:其他好文   时间:2014-05-21 08:24:18    阅读次数:354
POJ 3977Subset(枚举+二分)
Subset Time Limit: 30000MS   Memory Limit: 65536K Total Submissions: 1562   Accepted: 261 Description Given a list of N integers with absolute values no larger than 1015,...
分类:其他好文   时间:2014-05-21 07:16:37    阅读次数:409
[ACM] hdu 2717 Catch That Cow (BFS)
Catch That Cow Problem Description Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number li...
分类:其他好文   时间:2014-05-21 07:02:40    阅读次数:312
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!