[ACM]_查找
同学少年
没有什么不可能!
展开
-
[2010山东ACM省赛] Ivan comes again!(set 的使用)
Ivan comes again!Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述The Fairy Ivan gave Saya three problems to solve (Problem F). After Saya finished the first problem (Pro原创 2014-04-16 20:45:13 · 2190 阅读 · 1 评论 -
[ACM] ZOJ 3844 Easy Task (模拟+哈希)
Easy TaskTime Limit: 2 Seconds Memory Limit: 65536 KBYou are given n integers. Your task is very easy. You should find the maximum integer a and the minimum integer b among these n inte原创 2015-01-11 19:21:58 · 1971 阅读 · 0 评论 -
[ACM] HDU 2295 Radar (二分+DLX 重复覆盖)
RadarTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2593 Accepted Submission(s): 1012Problem Description N cities of the Jav原创 2014-10-07 14:04:40 · 2320 阅读 · 0 评论 -
[ACM] POJ 3273 Monthly Expense (二分解决最小化最大值)
Monthly ExpenseTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14158 Accepted: 5697DescriptionFarmer John is an astounding accounting wizard and has r原创 2014-07-23 16:05:24 · 4669 阅读 · 1 评论 -
[ACM] POJ 3258 River Hopscotch (二分,最大化最小值)
River HopscotchTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6697 Accepted: 2893DescriptionEvery year the cows hold an event featuring a peculiar ve原创 2014-07-23 17:51:10 · 2034 阅读 · 0 评论 -
[ACM] POJ 1936 All in All (查找,一个串是否在另一个串中)
All in AllTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 27521 Accepted: 11266DescriptionYou have devised a new encryption technique which encodes a me原创 2014-07-17 16:26:27 · 3014 阅读 · 0 评论 -
[ACM] hdu 2141 Can you find it? (二分查找)
Problem DescriptionGive you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbers Ai, Bj, Ck, which satisfy the formula Ai+Bj+C原创 2014-02-24 16:07:03 · 2224 阅读 · 0 评论 -
[ACM] POJ 1035 Spell checker (单词查找,删除替换增加任何一个字母)
Spell checkerTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 18693 Accepted: 6844DescriptionYou, as a member of a development team for a new spell check原创 2014-07-17 15:58:41 · 2786 阅读 · 1 评论 -
[ACM] poj 2456 Aggressive cows (二分查找)
Aggressive cowsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5436 Accepted: 2720DescriptionFarmer John has built a new long barn, with N (2 <= N <= 100,原创 2014-04-28 20:47:22 · 3164 阅读 · 3 评论 -
[ACM] poj 1064 Cable master (二分查找)
Cable masterTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21071 Accepted: 4542DescriptionInhabitants of the Wonderland have decided to hold a regional p原创 2014-04-28 19:31:03 · 2312 阅读 · 0 评论 -
[ACM] hdu 1181 变形课
解题思路:给出一堆单词,看能不能找到 一个或几个单词相连,使得首字母为b,末字母为m,如果可以输出YES,否则NO。 如果几个单词相连,要求相邻单词首末字母相同,如 big got them.思路是建立状态表,边输入边建立表, 比如单词ab,则c[0][1]=1,输入结束后,初步的表建立完成,那么连接单词,就要查找,根据状态表,找以b开头的单词,b-a,b-c,b-d.....z,最多找25次原创 2014-05-19 19:51:46 · 1590 阅读 · 0 评论 -
[2010山东ACM省赛] Greatest Number(数的组合+二分搜索)
Greatest NumberTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述Saya likes math, because she think math can make her cleverer.One day, Kudo invited a very simple game:Giv原创 2014-04-13 16:01:01 · 2281 阅读 · 0 评论 -
[ACM] hdu 1025 Constructing Roads In JGShining's Kingdom (最长递增子序列,lower_bound使用)
Constructing Roads In JGShining's KingdomTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14635 Accepted Submission(s): 4158Proble原创 2014-04-28 16:36:35 · 2177 阅读 · 0 评论 -
[ACM] CSU 1548 Design road (三分)
http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1548第一次接触三分,题意和代码参考的网上的。题意:修路:从(0,0)~(x,y),n个数表示有第二行开始有n行表示有n条河,tx是河的起始位置,ty是河的宽度,有水的地方要修桥,而x,y表示修路的端点,C1表示修路每米的花费,C2表示修桥每米的花费,问你最后花费的最少金额!思路:先把有原创 2015-04-05 20:06:01 · 1545 阅读 · 0 评论