09 2016 档案

dynamic programming 从入门到放弃
摘要：1. maxsum 最大连续子序列和 用d[i]表示以i结束的子序列和的最大值，状态转移方程为 d[i]=max{d[i-1]+a[i],a[i]},其中d[0]=a[0],然后对d[i] sort 取最大值 阅读全文
posted @ 2016-09-24 14:36 TomJarry 阅读(186) 评论(0) 推荐(0)
sscanf（）函数
摘要：C语言函数sscanf()的用法sscanf() - 从一个字符串中读进与指定格式相符的数据. 函数原型: int sscanf( string str, string fmt, mixed var1, mixed var2 ... ); int scanf( const char *format 阅读全文
posted @ 2016-09-18 17:30 TomJarry 阅读(223) 评论(0) 推荐(0)
poj-1200-hash-
摘要：Crazy Search Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 27602 Accepted: 7711 Description Many people like to solve hard puzzles some o 阅读全文
posted @ 2016-09-18 14:04 TomJarry 阅读(321) 评论(0) 推荐(0)
hduoj-1735 简单的贪心算法
摘要：字数统计 Time Limit: 1000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1987 Accepted Submission(s): 552 Problem Des 阅读全文
posted @ 2016-09-12 21:46 TomJarry 阅读(647) 评论(0) 推荐(0)
hduoj -2570-简单的贪心算法入门
摘要：迷瘴 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6739 Accepted Submission(s): 2272 Problem Desc 阅读全文
posted @ 2016-09-12 19:26 TomJarry 阅读(981) 评论(0) 推荐(0)