URAL 1005 Stone Pile (DFS)

最新推荐文章于 2022-04-19 21:19:11 发布

原创最新推荐文章于 2022-04-19 21:19:11 发布 · 457 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#URAL #1005 #Stone Pile DFS

Talk is cheap Show me the code 同时被 2 个专栏收录

168 篇文章

订阅专栏

ACM-ICPC

154 篇文章

订阅专栏

本文介绍了一个使用深度优先搜索（DFS）解决背包问题的C语言程序示例。该程序的目标是最小化两组物品重量之间的差异，通过递归地考虑每个物品是否放入背包中的一组来实现。定义了宏用于简化绝对值和无穷大的表示，并使用数组存储物品重量及总重量等。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <stdio.h>
#define ABS(x) ( (x) > 0 ? (x) : -(x) )
#define INF (1 << 31 - 1)
#define MAX_STONES (20 + 1)
#define MAX_WEIGHT (100000)


int numOfStones;
int weights[MAX_STONES];
int totalWeigh;
int minDifferOfWeight = INF;

void DFS(int depth, int currentWeigh){
    if (depth == numOfStones){
        if (ABS(totalWeigh - currentWeigh - currentWeigh) < minDifferOfWeight)
            minDifferOfWeight = ABS(totalWeigh - currentWeigh - currentWeigh);
        return;
    }

    DFS(depth + 1, currentWeigh + weights[depth + 1]);
    DFS(depth + 1, currentWeigh);
}
int main()
{

    scanf("%d", &numOfStones);
    int indexOfStone;
    for (indexOfStone = 1; indexOfStone <= numOfStones; indexOfStone++){
        scanf("%d", &weights[indexOfStone]);
        totalWeigh += weights[indexOfStone];
    }

    DFS(0, 0);

    printf("%d", minDifferOfWeight);
    return 0;
}