2010年12月7日

摘要: ArbitrageTime Limit:1000MSMemory Limit:65536KTotal Submissions:6340Accepted:2831DescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US Dollar buys 0.5 British pound, 阅读全文
posted @ 2010-12-07 14:05 yming0221 阅读(122) 评论(0) 推荐(0)

2010年12月6日

摘要: Til the Cows Come HomeTime Limit:1000MSMemory Limit:65536KTotal Submissions:13050Accepted:4261DescriptionBessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to 阅读全文
posted @ 2010-12-06 22:27 yming0221 阅读(133) 评论(0) 推荐(0)

2010年12月4日

摘要: BabelfishTime Limit:3000MSMemory Limit:65536KTotal Submissions:17068Accepted:7376DescriptionYou have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them.InputInput consists of 阅读全文
posted @ 2010-12-04 17:55 yming0221 阅读(138) 评论(0) 推荐(0)

2010年12月3日

摘要: 标记有空好好研究 阅读全文
posted @ 2010-12-03 22:14 yming0221 阅读(90) 评论(0) 推荐(0)
摘要: Tight wordsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2079Accepted: 1041DescriptionGiven is an alphabet {0, 1, ... , k}, 0 <= k <= 9 . We say that a word of length n over this alphabet is tight if any two neighbour digits in the word do not differ by more than 1. InputInput is a 阅读全文
posted @ 2010-12-03 08:57 yming0221 阅读(199) 评论(0) 推荐(0)

2010年12月1日

摘要: Charm BraceletTime Limit:1000MSMemory Limit:65536KTotal Submissions:6996Accepted:3174DescriptionBessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it with the best charms possible from theN(1 ≤N≤ 3,402) available charms. Each charmiin the su 阅读全文
posted @ 2010-12-01 22:13 yming0221 阅读(120) 评论(0) 推荐(0)
摘要: 动态规划经典为题给出不同的砝码,可以悬挂在天平的不同位置,求出可以保持天平平衡的悬挂种数BalanceTime Limit:1000MSMemory Limit:30000KTotal Submissions:4309Accepted:2521DescriptionGigel has a strange "balance" and he wants to poise it. Actually, the device is different from any other ordinary balance.It orders two arms of negligible we 阅读全文
posted @ 2010-12-01 13:46 yming0221 阅读(261) 评论(0) 推荐(0)
摘要: 经典动态规划现在对动态规划的子结构划分和子结构的理解,转移方程还没有明确的认识ZipperTime Limit:1000MSMemory Limit:65536KTotal Submissions:9409Accepted:3218DescriptionGiven three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed arb 阅读全文
posted @ 2010-12-01 12:46 yming0221 阅读(173) 评论(0) 推荐(0)

2010年11月30日

摘要: PalindromeTime Limit:3000MSMemory Limit:65536KTotal Submissions:33120Accepted:11122DescriptionA palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to write a program which, given a string, determines the minimal number of 阅读全文
posted @ 2010-11-30 08:35 yming0221 阅读(188) 评论(0) 推荐(0)

2010年11月29日

摘要: 每组给出两个字符串,输入以EOF结束,只输出公共子序列的最大长度第一次数组开100 RE,改成200后 AC!#include<stdio.h>#define MAX 200int opt[MAX][MAX];char str1[MAX],str2[MAX];int main(){ int str1_len,str2_len; int i,j; //freopen("input","r",stdin); while(scanf("%s %s",str1,str2)!=EOF) { str1_len=strlen(str1) 阅读全文
posted @ 2010-11-29 18:26 yming0221 阅读(160) 评论(0) 推荐(0)

导航