POJ1040-Transportation【dfs】

思路
设最大收入为best 初始值为0
订单数为Count
orders[i].from:起始站
orders[i].to:目的地站
orders[i].passengers订单的人数
orders[i].price订单价格
orders[i].remaining剩余订单价格（接受剩余订单）

约束条件：
枚举订单K途径的每个火车站i
判断是否超载

#include <iostream>
#include <cstdio>
#include <iomanip>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
using namespace std;
struct node
{
    int from;
    int to;
    int passengers;
    int price;
    int remaining;
} orders[23];

int train[8];
int best;
int n,m,Count;
void dfs(int start,int earnings)
{
    if(earnings>best) best=earnings;
    for(int k=start; k<=Count-1; k++)
    {
        if(earnings+orders[k].remaining<best)
            return;
        int flag=1;
        for(int i=orders[k].from; i<=orders[k].to-1; i++)
        {
            if(train[i]+orders[k].passengers>n)
                flag=0;
        }
        if(flag)
        {
            for(int i=orders[k].from; i<=orders[k].to-1; i++)
                train[i]+=orders[k].passengers;
            dfs(k+1,earnings+orders[k].price);
            for(int i=orders[k].from; i<=orders[k].to-1; i++)
            {
                train[i]-=orders[k].passengers;
            }
        }

    }

}

int main()
{
    while(~scanf("%d%d%d",&n,&m,&Count))
    {
        if(n==0&&m==0&&Count==0) break;
        memset(train,0,sizeof(train));
        for(int i=0; i<Count; i++)
        {
            scanf("%d%d%d",&orders[i].from,&orders[i].to,&orders[i].passengers);
            orders[i].price=(orders[i].to-orders[i].from)*orders[i].passengers;
        }
        for(int k=Count-1; k>=0; k--)
        {
            orders[k].remaining=orders[k].price+orders[k+1].remaining;
        }
        best=0;
        dfs(0,0);
        cout<<best<<endl;
    }
}