zoj2770_Burn the Linked Camp

思路：差分约束系统，将不等式转换为最小（大）路径求解利用bellman_ford算法计算，注意添加虚源点和虚源点到各点起始路径（长度为0）

#include<iostream>
#include<vector>
#include<string.h>
using namespace std;

vector<pair<int, long long>> edge[1100];    //边集数组
long long len[1100];                        //最大路径长度数组                      

bool bellman_ford(int n)
{
    len[0] = 0;
    for (int i = 0; i < edge[0].size(); i++)
    {
        len[edge[0][i].first] = 0 + edge[0][i].second;
    }
    for (int k = 0; k < n; k++)
    {
        for (int i = 0; i <= n; i++)
            for (int j = 0; j < edge[i].size(); j++)
            {
                if (len[edge[i][j].first]<len[i] + edge[i][j].second)
                    len[edge[i][j].first] = len[i] + edge[i][j].second;
            }
    }
    bool update = false;
    for (int i = 0; i <= n; i++)
        for (int j = 0; j < edge[i].size(); j++)
        {
            if (len[edge[i][j].first] < len[i] + edge[i][j].second)
                update = true;
        }
    if (update)
        return false;
    else
        return true;
}

int main()
{
    int n, m;
    while (cin >> n)
    {
        cin >> m;
        for (int i = 0; i <= n; i++)
            edge[i].clear();
        for (int i = 1; i <= n; i++)
            edge[0].push_back(make_pair(i, 0));
        for (int i = 0; i < n; i++)
        {
            int a;
            cin >> a;
            edge[i+1].push_back(make_pair(i,-a));
        }
        for (int i = 0; i < m; i++)
        {
            int a, b, c;
            cin >> a >> b >> c;
            edge[a-1].push_back(make_pair(b,c));
        }
        if (bellman_ford(n))
            cout << (len[n]-len[0]) << endl;
        else
            cout << "Bad Estimations" << endl;
    }
    return 0;
}