zoukankan      html  css  js  c++  java
  • hdu1712 分组背包 ACboy needs your help

    ACboy needs your help

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


    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
     
    Source
     
     
    #include<stdio.h>
    #include<string.h>
    #include<iostream>
    #include<algorithm>
    using namespace std;
    int a[200][200];
    int f[1000];
    int main(){
       int n,m;
       while(scanf("%d%d",&n,&m)!=EOF){
           if(n==0&&m==0)
           break;
        memset(f,0,sizeof(f));
           memset(a,0,sizeof(a));
           for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++)
                scanf("%d",&a[i][j]);
           }
    
           for(int i=1;i<=n;i++){
              for(int j=m;j>=0;j--){
                for(int k=1;k<=j;k++)
                    f[j]=max(f[j],f[j-k]+a[i][k]);
              }
           }
           printf("%d
    ",f[m]);
       }
       return 0;
    }
  • 相关阅读:
    SOA设计模式
    MVC架构设计模式
    12周总结
    11周总结
    window环境pycharm中使用cityscapes数据集训练deeplabv3+经验总结
    分析六大质量属性战术
    《一线架构师实践指南》第三章阅读笔记
    pip install 无法安装cv2
    PHP disable_functions Bypass
    MallBuilder逻辑后门(复现)
  • 原文地址:https://www.cnblogs.com/13224ACMer/p/4676274.html
Copyright © 2011-2022 走看看