POJ 3249 Test for Job 拓撲圖DP

求DAG上的鍊使其上點權和最大。

DAG當然上DP了。需要注意的是處理某個點的答案必須要其前置的點都先處理完才可。

畢竟是機房作業還是寫一下blog。。。

叫拓撲排序也沒啥問題。。

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define FOR(i,j,k) for(i=j;i<=k;++i)
#define ms(i) memset(i,0,sizeof(i))
const int N = , M = , inf = ;
int h[N], p[M], v[M], w[N], cnt, in[N], q[N], dp[N];
int main() {
    int n, m, i, a, b, f, r, u, ans;
    while (scanf("%d%d", &n, &m) != EOF) {
        f = r = cnt = ; ans = -inf;
        ms(h); ms(in); ms(out);
        FOR(i,,n) scanf("%d", &w[i]);
        while (m--) {
            scanf("%d%d", &a, &b);
            p[++cnt] = h[a]; v[cnt] = b; h[a] = cnt; ++in[b];
        }
        FOR(i,,n) dp[i] = in[i] ? -inf : w[i];
        FOR(i,,n) if (!in[i]) q[r++] = i;
        while (f < r) {
            u = q[f++];
            for (i = h[u]; i; i = p[i]) {
                dp[v[i]] = max(dp[v[i]], dp[u] + w[v[i]]);
                --in[v[i]]; if (!in[v[i]]) q[r++] = v[i];
            }
        }
        FOR(i,,n) ans = max(ans, dp[i]);
        printf("%d\n", ans);
    }
    return ;
}
           

Test for Job

Time Limit: 5000MS Memory Limit: 65536K

Total Submissions: 10199 Accepted: 2368

Description

Mr.Dog was fired by his company. In order to support his family, he must find a new job as soon as possible. Nowadays, It’s hard to have a job, since there are swelling numbers of the unemployed. So some companies often use hard tests for their recruitment.

The test is like this: starting from a source-city, you may pass through some directed roads to reach another city. Each time you reach a city, you can earn some profit or pay some fee, Let this process continue until you reach a target-city. The boss will compute the expense you spent for your trip and the profit you have just obtained. Finally, he will decide whether you can be hired.

In order to get the job, Mr.Dog managed to obtain the knowledge of the net profit Vi of all cities he may reach (a negative Vi indicates that money is spent rather than gained) and the connection between cities. A city with no roads leading to it is a source-city and a city with no roads leading to other cities is a target-city. The mission of Mr.Dog is to start from a source-city and choose a route leading to a target-city through which he can get the maximum profit.

Input

The input file includes several test cases.

The first line of each test case contains 2 integers n and m(1 ≤ n ≤ 100000, 0 ≤ m ≤ 1000000) indicating the number of cities and roads.

The next n lines each contain a single integer. The ith line describes the net profit of the city i, Vi (0 ≤ |Vi| ≤ 20000)

The next m lines each contain two integers x, y indicating that there is a road leads from city x to city y. It is guaranteed that each road appears exactly once, and there is no way to return to a previous city.

Output

The output file contains one line for each test cases, in which contains an integer indicating the maximum profit Dog is able to obtain (or the minimum expenditure to spend)

Sample Input

6 5

1

2

2

3

3

4

1 2

1 3

2 4

3 4

5 6

Sample Output

7