动态规划
文章平均质量分 64
机智勇敢的马少爷
马少爷~
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
HDU 1003 Max Sum
Max Sum Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 177393 Accepted Submission(s): 41369 Problem Description Given a sequence a[原创 2015-08-01 08:51:03 · 226 阅读 · 0 评论 -
HDU 2955 Robberies
Robberies Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 16116 Accepted Submission(s): 5905 Problem Description The aspiring Roy th原创 2015-07-31 11:03:59 · 218 阅读 · 0 评论 -
动态规划求最大连续和
#include #include int a[100005],sum[100005]; int main() { //freopen("input.txt","r",stdin); int t,n,i,max,x=0; scanf("%d",&t); while(t--) { if(x) printf("\n"); scan原创 2015-08-01 15:13:10 · 425 阅读 · 0 评论
分享