UVa 301 - Transportation

最新推荐文章于 2020-09-22 22:35:33 发布

cugfjp

最新推荐文章于 2020-09-22 22:35:33 发布

阅读量332

点赞数

分类专栏：算法文章标签： UVa

本文链接：https://blog.csdn.net/cugfjp/article/details/8938255

版权

算法专栏收录该内容

154 篇文章 0 订阅

订阅专栏

/*
回溯法
1、乘客限制。
2、当剩余所有票价加起来也不会超过最大价格则回溯。
AC：0.092s
*/
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
const int MAX_ORDERS = 22+2;
const int MAX_STOPS = 7+2;
struct order {
    int start;
    int destination;
    int passengers;
    int total_price;
};

order orders[MAX_ORDERS];
int n, m, ords;
int biggest_price;
int stops[MAX_STOPS]; //各站人数

//是否可以接受order
int can_take_order(int cur)
{
    for(int j=orders[cur].start; j<orders[cur].destination; j++) {
        stops[j] += orders[cur].passengers;
    }
    for(int i=0; i<m; i++) {
        if(stops[i] > n) return 0;
    }
    return 1;
}
//剩余票价加起来是否可以超过最大价格
int can_over(int cur, int price)
{
    int left_price = 0;
    for(int i=cur; i<ords; i++) {
        left_price += orders[i].total_price;
    }
    if(price+left_price <= biggest_price) {
        return 0;
    }
    return 1;
}

void dfs(int cur, int price)
{
    if(cur == ords) {
        if(price > biggest_price)
            biggest_price = price;
        return;
    }
    if(!can_over(cur, price)) return;

    int buff_stops[MAX_STOPS];
    memcpy(buff_stops, stops, sizeof(stops)); //保存
    if(can_take_order(cur)) {
        dfs(cur+1, price+orders[cur].total_price);
    }
    memcpy(stops, buff_stops, sizeof(buff_stops)); //恢复
    dfs(cur+1, price);
}

int main(void) {
    #ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    #endif
    while(scanf("%d%d%d", &n, &m, &ords) == 3) {
        if(m==0 && n==0 && ords==0) break;
        for(int i=0; i<ords; i++) {
            scanf("%d%d%d", &orders[i].start,
                  &orders[i].destination,
                  &orders[i].passengers);
            orders[i].total_price = (orders[i].destination -
                                     orders[i].start) *
                                     orders[i].passengers;
        }
        memset(stops, 0 ,sizeof(stops));
        biggest_price = 0;
        dfs(0, 0);
        printf("%d\n", biggest_price);
    }
    return 0;
}