USACO rockers

/*
    ID: m1500293
    LANG: C++
    PROG: rockers
*/
#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;
int f[30][30];   //前i个光盘结束于j首歌的最大歌曲数
int num[30][30]; //一张光盘最多容纳几首i-j的歌曲
int N, T, M;   //N首歌 T分钟 M张盘
int time[30];

int main()
{
    freopen("rockers.in", "r", stdin);
    freopen("rockers.out", "w", stdout);
    scanf("%d%d%d", &N, &T, &M);
    for(int i=1; i<=N; i++)
        scanf("%d", &time[i]);
    for(int i=1; i<=N; i++)
        for(int j=i; j<=N; j++)
        {
            num[i][j] = 0;
            int tp[30];
            memcpy(tp, time, sizeof(time));
            sort(tp+i, tp+i+(j-i+1));
            int tpT = T;
            int res = 0;
            for(int k=i; k<=j; k++)
            {
                if(tpT >= tp[k])
                    res++, tpT-=tp[k];
            }
            num[i][j] = res;
        }
    memset(f, 0, sizeof(f));
    for(int j=1; j<=N; j++) f[1][j] = num[1][j];
    for(int i=2; i<=M; i++)
        for(int j=1; j<=N; j++)
        {
            f[i][j] = max(f[i][j], f[i-1][j]);
            for(int k=1; k<j; k++)
                f[i][j] = max(f[i][j], f[i-1][k]+num[k+1][j]);
        }
    printf("%d\n", f[M][N]);
    return 0;
}