zoukankan      html  css  js  c++  java
  • USACO3.1.2Score Inflation

    Score Inflation

    The more points students score in our contests, the happier we here at the USACO are. We try to design our contests so that people can score as many points as possible, and would like your assistance.

    We have several categories from which problems can be chosen, where a "category" is an unlimited set of contest problems which all require the same amount of time to solve and deserve the same number of points for a correct solution. Your task is write a program which tells the USACO staff how many problems from each category to include in a contest so as to maximize the total number of points in the chosen problems while keeping the total solution time within the length of the contest.

    The input includes the length of the contest, M (1 <= M <= 10,000) (don't worry, you won't have to compete in the longer contests until training camp) and N, the number of problem categories, where 1 <= N <= 10,000.

    Each of the subsequent N lines contains two integers describing a category: the first integer tells the number of points a problem from that category is worth (1 <= points <= 10000); the second tells the number of minutes a problem from that category takes to solve (1 <= minutes <= 10000).

    Your program should determine the number of problems we should take from each category to make the highest-scoring contest solvable within the length of the contest. Remember, the number from any category can be any nonnegative integer (0, one, or many). Calculate the maximum number of possible points.

    PROGRAM NAME: inflate

    INPUT FORMAT

    Line 1: M, N -- contest minutes and number of problem classes
    Lines 2-N+1: Two integers: the points and minutes for each class

    SAMPLE INPUT (file inflate.in)

    300 4
    100 60
    250 120
    120 100
    35 20
    

    OUTPUT FORMAT

    A single line with the maximum number of points possible given the constraints.

    SAMPLE OUTPUT (file inflate.out)

    605
    

    (Take two problems from #2 and three from #4.)

    题解:就是一个完全背包。F[v]=max(F[v],F[v-Ci] +Wi)。

    View Code
     1 /*
     2 ID:spcjv51
     3 PROG:inflate
     4 LANG:C
     5 */
     6 #include<stdio.h>
     7 #include<string.h>
     8 long max(long a,long b)
     9 {
    10     return a>b?a:b;
    11 }
    12 int main(void)
    13 {
    14     freopen("inflate.in","r",stdin);
    15     freopen("inflate.out","w",stdout);
    16     long f[10005];
    17     long i,j,n,m;
    18     int v[10005],w[10005];
    19     scanf("%ld%ld",&m,&n);
    20     for(i=1; i<=n; i++)
    21         scanf("%d%d",&w[i],&v[i]);
    22     memset(f,0,sizeof(f));
    23     for(i=1; i<=n; i++)
    24         for(j=v[i]; j<=m; j++)
    25             f[j]=max(f[j],f[j-v[i]]+w[i]);
    26     printf("%ld\n",f[m]);
    27     return 0;
    28 }
  • 相关阅读:
    4.angularJS-指令(directive)
    3.AngularJS-过滤器
    Codeigniter处理用户登录验证后URL跳转
    为nginx配置https并自签名证书
    使用OpenSSL自签发服务器https证书
    用tomcat配置https自签名证书,解决 ios7.1以上系统, 苹果inHouse发布
    对称加密 和 非对称加密 的区别是什么
    **CodeIgniter系列 添加filter和helper
    **CodeIgniter通过hook的方式实现简单的权限控制
    php面向对象中public与var的区别
  • 原文地址:https://www.cnblogs.com/zjbztianya/p/2914316.html
Copyright © 2011-2022 走看看