Porcelain codeforce (背包)

E - Porcelain

Time Limit:3000MS    Memory Limit:262144KB    64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 148E

Description

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 Input

Input

2 3
3 3 7 2
3 4 1 5

Output

15

Input

1 3
4 4 3 1 2

Output

9

Hint

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.

#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
using namespace std;

int dp[10010];
int val[110];
int a[110];
int main()
{
	int n, m;
	while(scanf("%d %d", &n, &m) != EOF)
	{
		memset(dp, 0, sizeof(dp));
		for(int i = 1; i <= n; i++)
		{
			int k;
			scanf("%d", &k);
			for(int j = 1; j <= k; j++)
				scanf("%d", &a[j]);
			a[k+1] = 0;
			int sum1 = 0;
			
			memset(val, 0, sizeof(val));
			for(int j = 0; j <= k; j++)
			{
				sum1 += a[j];
				int sum2 = 0;
				for(int t = k+1; t >= 1; t--)
				{	
					sum2 += a[t];
					if(j >= t)
						continue;
					val[j+k+1-t] = max(val[j+k+1-t], sum1+sum2);
	
                                }
                        }
                        for(int j = m; j >= 0; j--)
			{
				for(int t = 1; t <= k; t++)
				{
					if(j >= t)
						dp[j] = max(dp[j], dp[j-t]+val[t]);
				}
			}
		}
		printf("%d\n", dp[m]);
	}
    return 0;                                                                
}