2019年3月11日
ACM1004：Let the Balloon Rise
摘要： Problem Description Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is gues 阅读全文
posted @ 2019-03-11 19:25 烈焰蔷薇 阅读(166) 评论(0) 推荐(0)
ACM1003：Max Sum
摘要： Problem Description Given 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 阅读全文
posted @ 2019-03-11 19:18 烈焰蔷薇 阅读(145) 评论(0) 推荐(0)