Codeforces Round #105 (Div. 2)--E. Porcelain 01背包

E. Porcelain

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

During her tantrums the princess usually smashes some collectable porcelain. Every furious shriek is accompanied with one item smashed.

The collection of porcelain is arranged neatly on n shelves. Within each shelf the items are placed in one row, so that one can access only the outermost items — the leftmost or the rightmost item, not the ones in the middle of the shelf. Once an item is taken, the next item on that side of the shelf can be accessed (see example). Once an item is taken, it can't be returned to the shelves.

You are given the values of all items. Your task is to find the maximal damage the princess' tantrum of m shrieks can inflict on the collection of porcelain.

Input

The first line of input data contains two integers n (1 ≤ n ≤ 100) and m (1 ≤ m ≤ 10000). The next n lines contain the values of the items on the shelves: the first number gives the number of items on this shelf (an integer between 1 and 100, inclusive), followed by the values of the items (integers between 1 and 100, inclusive), in the order in which they appear on the shelf (the first number corresponds to the leftmost item, the last one — to the rightmost one). The total number of items is guaranteed to be at least m.

Output

Output the maximal total value of a tantrum of m shrieks.

Sample test(s)

input

2 3
3 3 7 2
3 4 1 5

output

15

input

1 3
4 4 3 1 2

output

9

Note

In the first case there are two shelves, each with three items. To maximize the total value of the items chosen, one can take two items from the left side of the first shelf and one item from the right side of the second shelf.

In the second case there is only one shelf, so all three items are taken from it — two from the left side and one from the right side.

解决方案：这题可以转为01背包问题来求解，先是预处理每个书架拿n物品的最大值，这样就变成了每种物品有又有许多类型的物品，然后整个问题就变成了n种物品，每种物品又有许多类，然后每种物品要么不取，要取只能取其中的一类的01背包问题。

code：

#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int value[120][120];
int kvalue[120][120];
int sum[120];
int Cnt[120];
int res[12000];
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        memset(kvalue,0,sizeof(kvalue));
        memset(res,0,sizeof(res));
        for(int i=1; i<=n; i++)
        {
            memset(sum,0,sizeof(sum));
            int cnt;
            scanf("%d",&cnt);
            Cnt[i]=cnt;
            for(int j=1; j<=cnt; j++)
            {
                scanf("%d",&value[i][j]);
                sum[j]+=sum[j-1]+value[i][j];
            }
            for(int k=0; k<=cnt+1; k++)
                for(int u=k+1; u<=cnt+1; u++)
                {
                    kvalue[i][cnt-(u-k-1)]=max(kvalue[i][cnt-(u-k-1)],sum[k]+sum[cnt]-sum[u-1]);
                }

        }
        for(int i=1; i<=n; i++)
        {
            for(int v=m; v>=1; v--)
            {
                for(int j=1; j<=Cnt[i]&&j<=v; j++)
                {
                    res[v]=max(res[v-j]+kvalue[i][j],res[v]);
                }


            }
        }
        printf("%d\n",res[m]);
    }
    return 0;
}