搜索
关注
分享
扫一扫
文章平均质量分 84
HuanTongH
这个作者很懒，什么都没留下…
展开
-
poj 2785 双向搜索+哈希
4 Values whose Sum is 0 Time Limit: 15000MS Memory Limit: 228000K Total Submissions: 16271 Accepted: 4718 Case Time Limit: 5000MS Description The SUM problem can原创 2015-02-07 17:54:58 · 680 阅读 · 0 评论 -
poj 3368 离散化+线段树+二分
Frequent values Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 13911 Accepted: 5098 Description You are given a sequence of n integers a1 , a2 , ... , a原创 2015-02-13 17:38:27 · 618 阅读 · 0 评论 -
poj 3465 回溯+贪心
Battle Time Limit: 2000MS Memory Limit: 131072K Total Submissions: 1911 Accepted: 476 Description You're Zhu Rengong, a formidable hero. After a number of challenging原创 2015-02-23 17:31:51 · 601 阅读 · 0 评论 -
cf 484b 二分搜索/区间最值
B. Maximum Value time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output You are given a sequence a consisting of n原创 2015-02-23 17:02:00 · 725 阅读 · 0 评论 -
poj 3111 二分求最大化平均值
K Best Time Limit: 8000MS Memory Limit: 65536K Total Submissions: 6169 Accepted: 1651 Case Time Limit: 2000MS Special Judge Description Demy has n jewels.原创 2015-02-15 19:35:24 · 623 阅读 · 0 评论 -
poj 2549 双向搜索
Sumsets Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8665 Accepted: 2395 Description Given S, a set of integers, find the largest d such that a + b + c原创 2015-02-11 21:05:54 · 581 阅读 · 0 评论 -
poj 2796 st算法+二分 / 单调栈
Feel Good Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 10430 Accepted: 2855 Case Time Limit: 1000MS Special Judge Description Bill is develop原创 2015-03-07 18:29:32 · 530 阅读 · 0 评论 -
poj 3281 网络流Dinic算法
Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 10184 Accepted: 4682 Description Cows are such finicky eaters. Each cow has a preference for certa原创 2015-03-10 12:02:56 · 564 阅读 · 0 评论 -
poj 1816 Trie+DFS匹配模式串
Wild Words Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 4887 Accepted: 1274 Description A word is a string of lowercases. A word pattern is a string of原创 2015-04-26 12:06:21 · 522 阅读 · 0 评论