![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
C
SuperBeauty
这个作者很懒,什么都没留下…
展开
-
杭电ACM1003C做法
Max SumProblem 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 sum in this sequence is 6原创 2015-10-19 08:48:09 · 2276 阅读 · 0 评论 -
简单的桶排序
最近在看《啊哈!算法》,记录下笔记吧!将5 3 5 2 8进行排序#includeint main(){ int a[11],t,i,j; for(i=0;i<12;i++){ a[i]=0; } for(i=0;i<=4;i++){ scanf("%d",&t); a[t]++; } for(i=10;i>0;i--){ for(j=1;j<=a[i];j+原创 2015-11-16 17:48:28 · 1843 阅读 · 0 评论 -
杭电ACM1005 C做法
Number SequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 173466 Accepted Submission(s): 42860Problem DescriptionA number se原创 2017-06-28 20:55:59 · 3030 阅读 · 2 评论