2013年5月27日

CString类的完美总结 (转)

摘要: 原文地址:http://www.2cto.com/kf/201205/130195.htmlCString类的完美总结①、CString 类对象的初始化:CString str;CString str1(_T("abc"));CString str2 = _T("defg");TCHAR szBuf[] = _T("kkk");CString str3(szBuf);CString str4 = szBuf;TCHAR *p = _T("1k2");//TCHAR * 转换为 CStringCString str5 阅读全文

posted @ 2013-05-27 17:40 圣手摘星 阅读(182) 评论(0) 推荐(0) 编辑

2013年5月24日

HDU 4445 Crazy Tank (枚举)

摘要: D -Crazy TankTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uDescriptionCrazy Tank was a famous game about ten years ago. Every child liked it. Time flies, children grow up, but the memory of happy childhood will never go.Now you’re controlling the tank Laotu on a platform whic 阅读全文

posted @ 2013-05-24 20:56 圣手摘星 阅读(171) 评论(0) 推荐(0) 编辑

2013年5月19日

HDU 1231 最大连续子序列 动态规划

摘要: 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1231最大连续子序列Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14593Accepted Submission(s): 6377Problem Description给定K个整数的序列{ N1, N2, ..., NK },其任意连续子序列可表示为{ Ni, Ni+1, ...,Nj },其中 1 <= i <= j <= K 阅读全文

posted @ 2013-05-19 23:05 圣手摘星 阅读(160) 评论(0) 推荐(0) 编辑

HDU 1203 I NEED A OFFER! 动态规划(01背包)

摘要: 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1203I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11817Accepted Submission(s): 4529Problem DescriptionSpeakless很早就想出国,现在他已经考完了所有需要的考试,准备了所有要准备的材料,于是,便需要去申请学校了。要申请国外的任何大学,你都要交纳一定的申请费用,这 阅读全文

posted @ 2013-05-19 14:49 圣手摘星 阅读(121) 评论(0) 推荐(0) 编辑

2013年5月18日

HDU 1176 免费馅饼 动态规划

摘要: 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1176免费馅饼Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18353Accepted Submission(s): 6135Problem Description都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉 阅读全文

posted @ 2013-05-18 23:02 圣手摘星 阅读(147) 评论(0) 推荐(0) 编辑

2013年5月15日

HDU 1171 Big Event in HDU (多重bool背包) /(01背包)

摘要: 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1171Big Event in HDUTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16791Accepted Submission(s): 5908Problem DescriptionNowadays, we all know that Computer College is the biggest department in HDU. Bu 阅读全文

posted @ 2013-05-15 22:23 圣手摘星 阅读(184) 评论(0) 推荐(0) 编辑

2013年5月14日

HDU 1160 FatMouse's Speed 动态规划

摘要: 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1160FatMouse's SpeedTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6789Accepted Submission(s): 2960Special JudgeProblem DescriptionFatMouse believes that the fatter a mouse is, the faster it runs. 阅读全文

posted @ 2013-05-14 23:14 圣手摘星 阅读(186) 评论(0) 推荐(0) 编辑

HDU 1159 Common Subsequence 动态规划

摘要: 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1159Common SubsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16338Accepted Submission(s): 6810Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (pos 阅读全文

posted @ 2013-05-14 17:19 圣手摘星 阅读(147) 评论(0) 推荐(0) 编辑

Uva 11538 Chess Queen (数学规律题)

摘要: Problem AChess QueenInput:Standard InputOutput:Standard OutputYou probably know how the game of chess is played and how chess queen operates. Two chess queens are in attacking position when they are on same row, column or diagonal of a chess board. Suppose two such chess queens (one black and the ot 阅读全文

posted @ 2013-05-14 13:58 圣手摘星 阅读(253) 评论(0) 推荐(0) 编辑

2013年5月13日

HDU 1114 Piggy-Bank 背包问题

摘要: Piggy-BankTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7479Accepted Submission(s): 3736Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes f 阅读全文

posted @ 2013-05-13 22:17 圣手摘星 阅读(153) 评论(0) 推荐(0) 编辑

导航