BZOJ 1283 序列

题目大意

给出一个长度为$n$的正整数序列$C_i$,求一个子序列,使得原序列中任意长度为$m$的子串中被选出的元素不超过$k$($k,m \le 100$) 个,并且选出的元素之和最大。

阅读剩余部分 -

TopCoder::SRMCards

Problem Statement

You have a lot of cards. If you pick out a card with number x[i],card with number x[i]-1 and card with number x[i]+1 will also be picked out too. Determine the maxinum steps to pick out all the cards.

阅读剩余部分 -

TopCoder::Unpacking

Problem Statement

You have some boxes to buy, which contains red&blue candies. A box i contains a[i] red candies and b[i] blue candies as labeled. however it can also contains a[i]-1 red candies with b[i]+1 blue candies or a[i]+1 red candies with b[i]-1 blue candies. You want to buy as cheap set of boxes as possible which contains at least K candies with same color.

阅读剩余部分 -

最新文章

最近回复

板块

    本站托管于学园都市
    由御坂网络提供CDN加速服务