poj1976

最新推荐文章于 2021-08-15 16:04:37 发布

weixin_34072637

最新推荐文章于 2021-08-15 16:04:37 发布

阅读量55

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/rainydays/p/3149834.html

本文介绍了一个使用动态规划解决列车编组问题的算法实现。该算法通过最大化的利用机车头的数量来优化列车的编组方式。具体实现中运用了C语言，并通过具体的代码示例展示了如何进行输入输出及核心逻辑的处理。

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

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

#define MAX_COACH_NUM 50005

int coach_num;
int coach[MAX_COACH_NUM];
int f[4][MAX_COACH_NUM];
int sum[MAX_COACH_NUM];
int min_loco;

void input()
{
    scanf("%d", &coach_num);
    coach[0] = 0;
    for (int i = 1; i <= coach_num; i++)
        scanf("%d", &coach[i]);
    scanf("%d", &min_loco);
}

void work()
{
    memset(f, 0, sizeof(f));
    sum[0] = 0;
    for (int i = 1; i <= coach_num; i++)
        sum[i] = sum[i - 1] + coach[i];
    for (int i = 1; i <= 3; i++)
    {
        for (int j = coach_num - i * min_loco + 1; j > 0; j--)
            f[i][j] = max(f[i][j + 1], f[i - 1][j + min_loco] + sum[j + min_loco - 1] - sum[j - 1]);
    }
    printf("%d\n", f[3][1]);
}

int main()
{
    int t;
    scanf("%d", &t);
    while (t--)
    {
        input();
        work();
    }
    return 0;
}