Test for Job（topo+动态规划）

最新推荐文章于 2021-11-18 14:25:33 发布

x_y_q_

最新推荐文章于 2021-11-18 14:25:33 发布

阅读量418

点赞数

分类专栏： ACM_图论 ACM_动态规划

本文链接：https://blog.csdn.net/x_y_q_/article/details/51909601

版权

ACM_图论同时被 2 个专栏收录

19 篇文章 2 订阅

订阅专栏

ACM_动态规划

12 篇文章 0 订阅

订阅专栏

话不多说先上题目

Test for Job

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 10393		Accepted: 2429

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 profitV_i of all cities he may reach (a negative V_i 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, V_i (0 ≤ | V_i| ≤ 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

Sample Output

Hint

有向无环图最短路径或最大路径可以采用 topo排序+动态规划来做

不说了，实在太easy了

话说这题很水但也有一些要注意的地方

就是 dp[i]可以为负值，所以一开始dp 和 ans 都得设置成无穷小而且，最后答案要输出出度为0的点的dp值

那么。。为什么这么水的题目。。十分钟敲完了代码。。却wa了无数次，，卡了我好几个小时呢

看了网上的代码。。卧槽跟我的思路一样啊，唯一的区别就是他们没有用STL。。。然后我把STL里的vector和queue改掉了，立马ac

着实吓了我一跳，，还有题目用STL是不能过的？？我想那也不至于wa把最多最多超时（不过我还没遇到过）

回过头来仔细想想。。如果用数组邻接表+head[]形式的那种流行写法。。。。。因为有多组case。。。所以我的问题很明显了

那就是没有及时清空vector里的内容这里的vector功能其实跟head一样是记录与一个点相邻的各个点很明显每一次case前都应该将它清空

只需要在后面的代码的那个循环里加一句clear就ok啦。。。

真是不仔细。。而且做题经验太少了啊啊啊啊。。。。。

#include <cstdio>
#include <vector>
#include <queue>
#include <string.h>
#include <algorithm>
using namespace std;
#define INF 2100000000
#define M 1200005
#define N 100005
int w[N], in[N], out[N], dp[N];
vector<int> G[N];
int n, m, ans;

void topodp()
{
    queue<int> q;
    for(int i = 1; i <= n; i++){
        if(in[i] == 0){
            dp[i] = w[i];
            q.push(i);
        }
    }
    while(!q.empty()){
        int t = q.front();
        q.pop();
        for(int i = 0; i < G[t].size(); i++){
            int k = G[t][i];
            dp[k] = max(dp[k], w[k] + dp[t]);
            in[k]--;
            if(!in[k])    q.push(k);
        }
    }
}

int main()
{
    while(scanf("%d %d", &n, &m) != EOF){

        memset(in, 0, sizeof(in));
        memset(out, 0, sizeof(out));
        for(int i = 1; i <= n; i++){
            scanf("%d", &w[i]);
            G[i].clear();//这句话非常重要
        }
        for(int i = 1; i <= m; i++){
            int from, to;
            scanf("%d %d", &from, &to);
            in[to]++;
            out[from]++;
            G[from].push_back(to);
        }

        int ans = -INF;
        for(int i = 1; i <= n; i++)
            dp[i] = -INF;
        topodp();
        for(int i = 1; i <= n; i++)
            if(out[i] == 0)     ans = max(ans, dp[i]);
        printf("%d\n", ans);
    }
    return 0;
}