2012年3月26日

Safecracker

摘要： 传送门：http://acm.hdu.edu.cn/showproblem.php?pid=1015 分析：DFS#include <iostream>#include <cstring>#include <cstdio>#include <algorithm>using namespace std;char s[27], res[6];int target, ok[27], flag, len;int cal( char * a ){ int t, sum = 0; for ( int i = 0; i < 5; i++ ) { t = 阅读全文

posted @ 2012-03-26 16:30 GQHero 阅读(173) 评论(0) 推荐(0) 编辑

2011年9月24日

HDOJ 1003 MaxSum

摘要： Max SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 59034Accepted Submission(s): 13417Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max 阅读全文

posted @ 2011-09-24 13:57 GQHero 阅读(331) 评论(0) 推荐(1) 编辑

导航