usaco 3.4 Raucous Rockers 2010.8.4

最新推荐文章于 2019-11-08 15:22:06 发布

Batman_

最新推荐文章于 2019-11-08 15:22:06 发布

阅读量328

点赞数

分类专栏： USACO

本文链接：https://blog.csdn.net/Batman_/article/details/50659542

版权

USACO 专栏收录该内容

47 篇文章 0 订阅

订阅专栏

Raucous Rockers

You just inherited the rights to N (1 <=N <= 20) previously unreleased songs recorded by the popular group RaucousRockers. You plan to release a set of M (1 <= M <= 20) compact disks witha selection of these songs. Each disk can hold a maximum of T (1 <= T <=20) minutes of music, and a song can not overlap from one disk to another.

Since you are a classical music fan andhave no way to judge the artistic merits of these songs, you decide on thefollowing criteria for making the selection:

The songs on the set of disks must appearin the order of the dates that they were written.

The total number of songs included will bemaximized.

PROGRAM NAME: rockers

INPUT FORMAT

Line 1: Three integers: N, T, and M.

Line 2: N integers that are the lengths ofthe songs ordered by the date they were written.

SAMPLE INPUT (file rockers.in)

4 5 2

4 3 4 2

OUTPUT FORMAT

A single line with an integer that is thenumber of songs that will fit on M disks.

SAMPLE OUTPUT (file rockers.out)

/*
ID:
PROG:rockers
LANG:C++
*/

#include <cstdio>
#include <cstring>

#define MAXN 25

int max[MAXN],g[MAXN][MAXN],t[MAXN];

int main()
{
int n,T,m;
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",&t[i]);
for(int i=1;i<=n;i++)
   for(int j=m;j>=1;j--)
   {
    g[j][0]=max[j-1];
    for(int v=T;v>=t[i];v--)
    {
     if (g[j][v]<=g[j][v-t[i]]+1)
      g[j][v]=g[j][v-t[i]]+1;
     if (g[j][v]>max[j])
      max[j]=g[j][v];
    }
   }
printf("%d\n",max[m]);
return 0;
}

Compiling...

Compile: OK

Executing...

Test 1: TEST OK [0.011 secs, 2884 KB]

Test 2: TEST OK [0.000 secs, 2884 KB]

Test 3: TEST OK [0.000 secs, 2884 KB]

Test 4: TEST OK [0.000 secs, 2884 KB]

Test 5: TEST OK [0.000 secs, 2884 KB]

Test 6: TEST OK [0.000 secs, 2884 KB]

Test 7: TEST OK [0.022 secs, 2884 KB]

Test 8: TEST OK [0.000 secs, 2884 KB]

Test 9: TEST OK [0.000 secs, 2884 KB]