poj3249Test for Job记忆化搜索

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

题目大意
给出一个无环有向图,每一个点有一个权值,求从一个入度为0的点到一个出度为0点的最大权值和。

输入
存在多组数据,每一组数据第一行输入两个整数n,m。接下来n行每行一个整数,第i行代表第i个点的权值。接下来m行每行两个数x,y代表x到y之间有一条有向边。

输出
一个整数代表从一个入度为0的点到一个出度为0点的最大权值和。


注意事项
1.有多组数据,注意清0
2.权值存在负数,dp数组赋初值时要赋值成-inf


#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<set>
#include<queue>
#include<map>
using namespace std;
const int maxn=1000001,inf=1e9*-1;
vector<int> edge[maxn];
int n,m,dp[maxn],w[maxn];
bool p[maxn];
int dfs(int x){
    if(edge[x].size()==0) 
        return dp[x]=w[x];
    if(dp[x]!=inf) return dp[x];
    int i,len=edge[x].size();
    for(i=0;i<len;i++)
        dp[x]=max(dp[x],dfs(edge[x][i])+w[x]);
    return dp[x];
}
int main(){
    int i,j,k;
    int x,y;
    //freopen("test.in","r",stdin);
    //freopen("test.out","w",stdout);
    while(scanf("%d%d",&n,&m)!=EOF){
        memset(p,0,sizeof(p));
        for(i=1;i<=n;i++)
            scanf("%d",&w[i]);
        for(i=1;i<=n;i++)
            dp[i]=inf;
        for(i=1;i<=m;i++){
            scanf("%d%d",&x,&y);
            edge[x].push_back(y);
            p[y]=1;
        }
        for(i=1;i<=n;i++)
            if(!p[i]) dfs(i);
        int maxe=inf;
        for(i=1;i<=n;i++){
            if(!p[i])
                maxe=max(maxe,dp[i]);
            edge[i].clear();
        }
        printf("%d\n",maxe);
    }
    return 0;
}
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/yalishiyanzhouyu888/article/details/52289897
文章标签: poj 搜索
个人分类: poj
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭
关闭