
简单的处理
&小鹏鹏
邮箱:18140035@bjtu.edu.cn
展开
-
K-Max Sum
Description Here there is a very classical problem --- Max Sum! Let's review the classsical problem: Given a sequence a[1], a[2], a[3] ...... a[N], your job is to calculate the max sum of a sub-se转载 2014-05-16 11:32:26 · 458 阅读 · 0 评论 -
2014 ACMICPC Asia Regional Anshan Online G Osu!
[Problem Description] Osu! is a famous music game that attracts a lot of people. In osu!, there is a performance scoring system, which evaluates your performance. Each song you have played will ha翻译 2014-09-13 17:48:42 · 391 阅读 · 0 评论