zoukankan      html  css  js  c++  java
  • XidianOJ 1172 Hiking

    题目描述

    BlacKin and GKCY are going hiking together.
    Besides their personal items, there are some items they share together.
    They decided to devide those shared items into two parts.
    So each of them has to carry their own items and a part of shared items.
    To make it fair, they hope the weight difference between those two parts can be as small as possible.
    Now they want to know how small it can be.

    输入

    Multiple test cases, please read until EOF
    For each test case:
    First line a single integer n (1 <= n <= 200), number of shared items.
    Second line n integers, Wi (1 <= Wi <= 200), weight of each item.

    输出

    For each test case:
    One line a single integer, the smallest difference between two part.

    --正文

    又是宝藏分配。。。

    #include <cstdio>
    #include <cstring>
    #include <iostream>
    #include <algorithm>
    using namespace std;
    
    int f[40000];
    int cost[201];
    int w,sum,n;
    int main(){
        while (scanf("%d",&n) != EOF){
            int i,j;
            sum = 0;
            for (i=1;i<=n;i++){
                scanf("%d",&cost[i]);
                sum += cost[i];
            }
            w = sum / 2;
            memset(f,0,sizeof(f));
            for (i=1;i<=n;i++){
                for (j=w;j>=cost[i];j--){
                    f[j] = max(f[j],f[j-cost[i]] + cost[i]);
                }
            }
            int res = sum - 2*f[w]; if (res < 0) res = -res;
            printf("%d
    ",res);
        }
    }
  • 相关阅读:
    Excel编程的基本概念
    Excel中的基本概念
    How to create Excel file in C#
    学生管理系统----当然封装类型
    iphone6 plus有什么办法
    买面包和IoC
    拆除vs发展c++程序开发过程中产生的.ipch和.sdf文件的方法
    Socket编程实践(4) --更复杂的过程server
    BestCoder Round #16
    流动python
  • 原文地址:https://www.cnblogs.com/ToTOrz/p/6164193.html
Copyright © 2011-2022 走看看