ZOJ Problem Set – 1002

原题:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1002 试水ZOJ的第一题,果然ACM的难度比PAT大一些,入门题目都那么长… 思路其实不难,弄个二维数组来搞,有点回溯的味道,刚巧最近看书看到了分而治之还要动态规划什么的 某一步的结果= max{当前位置放置1个+后面位置放置个数, 当前位置放置0个+后面位置放置个数} 然后就能做啦~  

HDOJ-1097 A hard puzzle

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 23989    Accepted Submission(s): 8466 Problem Description lcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem,so lcy makes the problem easier than begin. this puzzle describes that: gave a and b,how to know
Continue reading HDOJ-1097 A hard puzzle