ACM
Ape__
我有个野心。
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
杭电ACM1000
Calculate A + B. Input Each line will contain two integers A and B. Process to end of file. Output For each case, output A + B in one line. /*************** Ape 2014/12/原创 2014-12-18 12:57:50 · 545 阅读 · 0 评论 -
杭电ACM1003
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), the max sum in this sequence is 6 + (-1) +转载 2014-12-18 13:15:34 · 719 阅读 · 0 评论
分享