SuperBeauty的专栏

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

最近在看《啊哈！算法》，记录下笔记吧！将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+

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