POJ-1056-IMMEDIATE DECODABILITY (字典树)
原题: An encoding of a set of symbols is said to be immediately decodable if no code for one symbol is the pref
poj 3278 || hdu2717 Catch That Cow 人生第一道BFS
题目: Catch That Cow Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu DescriptionFar
POJ 题目1056 IMMEDIATE DECODABILITY(字典树)
IMMEDIATE DECODABILITY Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11629 Accepted: 5543 Description An enc
POJ 1056 IMMEDIATE DECODABILITY(字典树 水题)
IMMEDIATE DECODABILITY Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 13014 Accepted: 6235 Description An enc
POJ 1056 IMMEDIATE DECODABILITY
Description An encoding of a set of symbols is said to be immediately decodable if no code for one symbol is the prefix
POJ 1380 Equipment Box(大矩形包含小矩形判定)
POJ 1380 Equipment Box(大矩形包含小矩形判定) http:pojproblem?id1380 题意: 给你两个矩形的长和宽,问你后一个矩形能否放在前一个矩形中?(小矩形的顶点不能在大矩形的边上) 分析: 首
POJ 1380 Equipment Box(判断一个长方形能不能包含另一个长方形)
Equipment Box 博客原文地址:http:blog.csdnxuechelingxiaoarticledetails40867049 题目大意: 给你两个矩形的长和宽&am
POJ 3104 二分
Description It is very hard to wash and especially to dry clothes in winter. But Jane is a very smart girl. She is not a
POJ 3104 Drying
POJ 3104 Drying 题目链接 Description It is very hard to wash and especially to dry clothes in winter. But Jane is a very
POJ 3669 Meteor Shower(预处理 + BFS)
Description Bessie hears that an extraordinary meteor shower is coming; reports say that these meteors will crash into e
POJ 3669 Meteor Shower BFS
Description Bessie hears that an extraordinary meteor shower is coming; reports say that these meteors will crash into e
poj 3684 Destroy
题目链接:http:acm.zju.eduonlinejudgeshowProblem.do?problemId4947 题目大意: 给定一棵树,每条边有两种权值(lenth:边的长度,power:去掉这条边需要的花费). 有且
图论--网络流--最大流 POJ 2289 Jamie's Contact Groups (二分+限流建图)
Description Jamie is a very popular girl and has quite a lot of friends, so she always keeps a very long contact list i
POJ 1287Networking
Networking Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12530 Accepted: 6732 Description You are assigned
【poj 2976】 Dropping tests二分(分数优化)
题目:http:pojproblem?id2976 Dropping tests Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 912
THE DRUNK JAILER POJ 1218
Description A certain prison contains a long hall of n cells, each right next to each other. Each cell has a prisoner in
POJ 3538 Domestic Networks(DP)
题目链接:点击打开链接 思路: 选一些边, 使得任意两点都可以相互到达且花费最小, 这显然是最小生成树, 将边挑选出来之后&
POJ 1004 Financial Management
Financial Management Time Limit: 1000MS Memory Limit: 10000K Description Larry graduated this year and finally has a
POJ 1637 Sightseeing tour
Sightseeing tour Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2639 Accepted: 1071 Description The city exec
poj 1852 ANTS
这道题目很有意思,说是有一根杆和一群蚂蚁,输入这些蚂蚁的位置信息(距离左边),然后求出蚂蚁全部落下杆的最短和最长时间。 需要稍微
发表评论