zoukankan      html  css  js  c++  java
  • hdu 1171 Big Event in HDU

    背包题,不过要注意是n<0结束而不是等于-1,这个地方wa了2次。

    Big Event in HDU

    Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 19784    Accepted Submission(s): 6913


    Problem Description
    Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever been split into Computer College and Software College in 2002.
    The splitting is absolutely a big event in HDU! At the same time, it is a trouble thing too. All facilities must go halves. First, all facilities are assessed, and two facilities are thought to be same if they have the same value. It is assumed that there is N (0<N<1000) kinds of facilities (different value, different kinds).
     
    Input
    Input contains multiple test cases. Each test case starts with a number N (0 < N <= 50 -- the total number of different facilities). The next N lines contain an integer V (0<V<=50 --value of facility) and an integer M (0<M<=100 --corresponding number of the facilities) each. You can assume that all V are different.
    A test case starting with a negative integer terminates input and this test case is not to be processed.
     
    Output
    For each case, print one line containing two integers A and B which denote the value of Computer College and Software College will get respectively. A and B should be as equal as possible. At the same time, you should guarantee that A is not less than B.
     
    Sample Input
    2 10 1 20 1 3 10 1 20 2 30 1 -1
     
    Sample Output
    20 10 40 40
     
    #include<stdio.h>
    #include<string.h>
    #define N 250005
    int max(int a,int b)
    {
        return a>b?a:b;
    }
    int dp[N];
    struct tt
    {
        int w,num;
    }a[105];
    int main()
    {
        int n,i,j,k;
        while(~scanf("%d",&n))
        {
            if(n<0) break;
            memset(dp,0,sizeof(dp));
            int sum=0;
            for(i=0;i<n;i++)
                {scanf("%d %d",&a[i].w,&a[i].num); sum+=a[i].w*a[i].num;}
                int v=sum/2;
               // printf("%d %d
    ",sum,v);
            for(i=0;i<n;i++)
                for(j=1;j<=a[i].num;j++)
                for(k=v;k>=a[i].w;k--)
                dp[k]=max(dp[k],dp[k-a[i].w]+a[i].w);
                if(dp[v]<sum-dp[v])
            printf("%d %d
    ",sum-dp[v],dp[v]);
            else
                printf("%d %d
    ",dp[v],sum-dp[v]);
        }
        return 0;
    }
  • 相关阅读:
    Android studio的基本使用
    Java web项目基本介绍
    关于缓存的问题
    tomcat的基本使用
    https的页面内嵌入http页面报错的问题
    RTTHREAD使用sscanf遇到的问题
    Supervisor安装与配置(Linux/Unix进程管理工具)
    MYSQL 检查表的元数据是否有异常
    多表select count语句生成 带格式化
    MYSQL压缩表测试
  • 原文地址:https://www.cnblogs.com/llei1573/p/3440355.html
Copyright © 2011-2022 走看看