zoukankan      html  css  js  c++  java
  • hdu 1712 分组背包

    ACboy needs your help

    Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 3124    Accepted Submission(s): 1623


    Problem Description
    ACboy has N courses this term, and he plans to spend at most M days on study.Of course,the profit he will gain from different course depending on the days he spend on it.How to arrange the M days for the N courses to maximize the profit?
     

    Input
    The input consists of multiple data sets. A data set starts with a line containing two positive integers N and M, N is the number of courses, M is the days ACboy has.
    Next follow a matrix A[i][j], (1<=i<=N<=100,1<=j<=M<=100).A[i][j] indicates if ACboy spend j days on ith course he will get profit of value A[i][j].
    N = 0 and M = 0 ends the input.
     

    Output
    For each data set, your program should output a line which contains the number of the max profit ACboy will gain.
     

    Sample Input
    2 2
    1 2
    1 3
    2 2
    2 1
    2 1
    2 3
    3 2 1
    3 2 1
    0 0
     
    Sample Output
    3
    4
    6
    #include<iostream>
    #include<cmath>
    #include<cstring>
    #include<cstdio>
    using namespace std;
    int main()
    {
        int n,m,p[110][110],s[110][110];
        int i,j,k,v;
        while(cin>>n>>m)
        {
            if(n==0&&m==0)
                break;
            for(i=1; i<=n; i++)
                for(j=1; j<=m; j++)
                    scanf("%d",&p[i][j]);
            memset(s,0,sizeof(s));
            for(i=1; i<=n; i++)
            {
                for(j=m; j>=0; j--)
                    for(k=j; k>=1; k--)
                    {
                        s[i][j]=max(s[i][j],s[i-1][j]);//开始没有加这一句,一直wa
                        s[i][j]=max(s[i][j],s[i-1][j-k]+p[i][k]);
                    }

            }
            int mm=0;
            for(i=1; i<=m; i++)
                if(s[n][i]>mm)
                    mm=s[n][i];
            cout<<mm<<endl;
        }
    }

  • 相关阅读:
    穷人思维与富人思维
    纯真IP库读取文件
    memcached 分布式 一致性hash算法demo
    纯CSS画的基本图形(矩形、圆形、三角形、多边形、爱心、八卦等)
    IPhone在横屏字体变大解决办法-webkit-text-size-adjust
    js设计模式---阅读笔记002--接口
    js设计模式---阅读笔记001--富有表现力的js
    关于js继承
    js正则表达式中test,exec,match方法的区别说明
    js获取自定义的属性值
  • 原文地址:https://www.cnblogs.com/ainixu1314/p/3379057.html
Copyright © 2011-2022 走看看