ACM练习
BOY
这个作者很懒,什么都没留下…
展开
-
HDU-1003 Max Sum
Problem 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 + (-1) + 5 +原创 2012-03-18 18:09:10 · 440 阅读 · 0 评论 -
HDU--1004 Let the Balloon Rise
import java.util.HashMap;import java.util.Iterator;import java.util.Map;import java.util.Map.Entry;import java.util.Scanner;import java.util.Set;public class BalloonRise2 { public sta原创 2012-03-19 19:39:55 · 391 阅读 · 0 评论