摘要:
Time Limit:1000MS Memory Limit:32768KB Description Contest time again! How excited it is to see balloons floating around. But to tell you a secret, th 阅读全文
posted @ 2015-02-24 10:52
呆尐兔兔
阅读(468)
评论(0)
推荐(0)
摘要:
Time Limit:1000MS Memory Limit:32768KB Description Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. 阅读全文
posted @ 2015-02-24 01:56
呆尐兔兔
阅读(365)
评论(0)
推荐(0)
摘要:
Time Limit:1000MS Memory Limit:32768KB Description I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum 阅读全文
posted @ 2015-02-24 00:29
呆尐兔兔
阅读(302)
评论(0)
推荐(0)

浙公网安备 33010602011771号