for (i = 0; i < n; i ++)
{
	f[i][0] = sum[i];
	for (j = 1; j <= q; j ++)
	{
		if (j > i) break;
		f[i][j] = -1;
		for (k = j - 1; k < i; k ++)
		{
			max = f[k][j-1] > sum[i]-sum[k] ? f[k][j-1] : sum[i]-sum[k];
			if ((max < f[i][j]) || (f[i][j] == -1))
			{
				f[i][j] = max;
				p[i][j] = k + 1;
			}
		}
	}
}