zoukankan      html  css  js  c++  java
  • A. Test for Job

    A. Test for Job

    5000ms
    5000ms
    65536KB
     
    64-bit integer IO format: %lld      Java class name: Main
     

    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 Viindicates 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 iVi (0 ≤ |Vi| ≤ 20000)
    The next m lines each contain two integers xy 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

    解题:记忆化搜索,找出值最大的路径。。。。返回该值。。。

     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <cstdlib>
     5 #include <vector>
     6 #include <climits>
     7 #include <algorithm>
     8 #include <cmath>
     9 #define LL long long
    10 using namespace std;
    11 const int INF = 1000000000;
    12 const int maxn = 100010;
    13 vector<int>e[maxn];
    14 int ret[maxn],in[maxn],w[maxn];
    15 int n,m;
    16 int dfs(int u){
    17     if(ret[u] != -INF) return ret[u];
    18     ret[u] = w[u];
    19     int i,temp,ans = -INF;
    20     for(i = 0; i < e[u].size(); i++){
    21         temp = dfs(e[u][i]);
    22         if(temp > ans) ans = temp;
    23     }
    24     if(ans != -INF) ret[u] += ans;
    25     return ret[u];
    26 }
    27 int main(){
    28     int i,x,y,ans,temp;
    29     while(~scanf("%d%d",&n,&m)){
    30         for(i = 1; i <= n; i++){
    31             e[i].clear();
    32             ret[i] = -INF;
    33             scanf("%d",w+i);
    34         }
    35         memset(in,0,sizeof(in));
    36         for(i = 0; i < m; i++){
    37             scanf("%d %d",&x,&y);
    38             e[x].push_back(y);
    39             in[y]++;
    40         }
    41         ans = -INF;
    42         for(i = 1; i <= n; i++){
    43             if(!in[i]){
    44                 temp = dfs(i);
    45                 if(temp > ans) ans = temp;
    46             }
    47         }
    48         printf("%d
    ",ans);
    49     }
    50     return 0;
    51 }
    View Code
  • 相关阅读:
    ORACLE函数介绍
    msdn的javascript文章转载
    baidu的高级搜索命令
    周杰伦 青花瓷 蒲公英的约定 我不配 彩虹 歌词和下载
    谷歌百度相争 新浪渔翁得利
    tomcat+jsp web运行环境搭建
    C#2008与.NET 3.5 高级程序设计读书笔记(24) LINQ API编程
    C#2008与.NET 3.5 高级程序设计读书笔记(16) 类型反射、晚期绑定和基于特性的编程
    C#2008与.NET 3.5 高级程序设计读书笔记(15) .NET程序集入门
    C#2008与.NET 3.5 高级程序设计读书笔记(25) WCF
  • 原文地址:https://www.cnblogs.com/crackpotisback/p/3841061.html
Copyright © 2011-2022 走看看