HDU 1224 Free DIY Tour(最短路orDP)

版权声明:希望我的博客可以为别人带去知识与便利,让那些像我曾经一样迷茫的小伙伴不再迷茫~ https://blog.csdn.net/qq_34374664/article/details/80412376


Free DIY Tour

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7894    Accepted Submission(s): 2582


Problem Description
Weiwei is a software engineer of ShiningSoft. He has just excellently fulfilled a software project with his fellow workers. His boss is so satisfied with their job that he decide to provide them a free tour around the world. It's a good chance to relax themselves. To most of them, it's the first time to go abroad so they decide to make a collective tour.

The tour company shows them a new kind of tour circuit - DIY circuit. Each circuit contains some cities which can be selected by tourists themselves. According to the company's statistic, each city has its own interesting point. For instance, Paris has its interesting point of 90, New York has its interesting point of 70, ect. Not any two cities in the world have straight flight so the tour company provide a map to tell its tourists whether they can got a straight flight between any two cities on the map. In order to fly back, the company has made it impossible to make a circle-flight on the half way, using the cities on the map. That is, they marked each city on the map with one number, a city with higher number has no straight flight to a city with lower number. 

Note: Weiwei always starts from Hangzhou(in this problem, we assume Hangzhou is always the first city and also the last city, so we mark Hangzhou both 1 and N+1), and its interesting point is always 0.

Now as the leader of the team, Weiwei wants to make a tour as interesting as possible. If you were Weiwei, how did you DIY it?
 

Input
The input will contain several cases. The first line is an integer T which suggests the number of cases. Then T cases follows.
Each case will begin with an integer N(2 ≤ N ≤ 100) which is the number of cities on the map.
Then N integers follows, representing the interesting point list of the cities.
And then it is an integer M followed by M pairs of integers [Ai, Bi] (1 ≤ i ≤ M). Each pair of [Ai, Bi] indicates that a straight flight is available from City Ai to City Bi.
 

Output
For each case, your task is to output the maximal summation of interesting points Weiwei and his fellow workers can get through optimal DIYing and the optimal circuit. The format is as the sample. You may assume that there is only one optimal circuit. 

Output a blank line between two cases.
 

Sample Input
2 3 0 70 90 4 1 2 1 3 2 4 3 4 3 0 90 70 4 1 2 1 3 2 4 3 4
 

Sample Output
CASE 1# points : 90 circuit : 1->3->1 CASE 2# points : 90 circuit : 1->2->1
 

Author
JGShining(极光炫影)
 

Source
 

Recommend
Ignatius.L

题意:给你n个城市,每个城市都有一个风景值,再给你m条路,每条路连接两个城市,只能从序号小的到序号大的,问你从1号到n+1号能经过的风景值得和最大为多少,并且输出路径。


思路:n才100,随便暴力。。为了练习java谢了最短路,分别用spfa与dij,记录路径也比较简单,用一个pre数组,记录每一个点他上面的点是什么,最后逆推回去就好

import java.util.Arrays;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.Vector;

class Main
{
	static final int maxn = 1000;
	static final int INF = 0x3f3f3f3f; 
	static int[] dis = new int[maxn];
	static int[] book = new int[maxn];
	static int[] pre = new int[maxn];
	static int[] cost = new int[maxn];
	static int[] res = new int[maxn];
	static class node implements Comparable<node>
	{
		int to, w;
		node(int tt, int ww)
		{
			this.to = tt;
			this.w = ww;
		}
		@Override
		public int compareTo(node o) 
		{
			// TODO Auto-generated method stub
			return this.w - o.w;
		}
	}
	static Vector<node>[] v = new Vector[maxn];
	static void spfa()
	{
		Arrays.fill(book, 0);
		Arrays.fill(pre, -1);
		Arrays.fill(dis, 0);
		Queue<Integer> q = new LinkedList<Integer>();
		q.add(1);
		dis[1] = 0;
		while(!q.isEmpty())
		{
			int u = q.poll();
			book[u] = 0;
			for(int i = 0; i < v[u].size(); i++)
			{
				int to = v[u].get(i).to;
				if(dis[to] < dis[u] + cost[to])
				{
					dis[to] = dis[u] + cost[to];
					pre[to] = u;
					if(book[to] == 0)
					{
						book[to] = 1;
						q.add(to);
					}
				}
			}
		}
	}
	static void dij()
	{
		Arrays.fill(dis, 0);
		Arrays.fill(pre, -1);
		Queue<node> pq = new PriorityQueue<node>();
		pq.add(new node(1, 0));
		while(!pq.isEmpty())
		{
			int u = pq.poll().to;
			for(int i = 0; i < v[u].size(); i++)
			{
				int to = v[u].get(i).to;
				if(dis[to] < dis[u] + cost[to])
				{
					pre[to] = u;
					dis[to] = dis[u] + cost[to];
					pq.add(new node(to, dis[to]));
				}
			}
		}
	}
	public static void main(String[] args) 
	{
		Scanner sc = new Scanner(System.in);
		for(int i = 0; i < maxn; i++) 
			v[i] = new Vector<node>();
		int _, n, m, ca = 1;
		_ = sc.nextInt();
		while(_-- > 0)
		{
			for(int i = 0; i < maxn; i++)
			{
				v[i].clear();
				cost[i] = 0;
				
			}
			n = sc.nextInt();
			for(int i = 1; i <= n; i++)
				cost[i] = sc.nextInt();
			m = sc.nextInt();
			for(int i = 1; i <= m; i++)
			{
				int u = sc.nextInt();
				int to = sc.nextInt();
				if(u > to) 
				{
					int tmp = u;
					u = to;
					to = tmp;
				}
				v[u].add(new node(to, 0));
			}
			//spfa();
			dij();
		    System.out.println("CASE " + (ca++) + "#");  
            System.out.println("points : " + dis[n + 1]);  
            System.out.print("circuit : ");  
			int cnt = 0;
			int p = n + 1;
			while(p != -1)
			{
				res[cnt++] = p;
				p = pre[p];
			}
			for(int i = cnt-1; i > 0; i--)
				System.out.print(res[i] + "->");
			System.out.println(1);
			if(_ != 0)
				System.out.println();
		}
	}
}

DP代码:

import java.lang.reflect.Array;  
import java.util.Arrays;  
import java.util.LinkedList;  
import java.util.Queue;  
import java.util.Scanner;  
import java.util.Vector;  
  
public class Main {  
    static final int maxn = 105;  
    static final int INF = 0x3f3f3f3f;  
    static int[] dp = new int[maxn];  
    static int[] cost = new int[maxn];  
    static int[] pre = new int[maxn];  
    static int[] rec = new int[maxn];  
    static Vector<Integer>[] g = new Vector[maxn];  
  
    public static void main(String[] args) {  
        Scanner sc = new Scanner(System.in);  
        for (int i = 0; i < maxn; i++)  
            g[i] = new Vector<Integer>();  
        int _, n, m, ca = 1;  
        _ = sc.nextInt();  
        while (_-- != 0) {  
            for (int i = 0; i < maxn; i++) {  
                g[i].clear();  
                cost[i] = 0;  
            }  
            n = sc.nextInt();  
            for (int i = 1; i <= n; i++)  
                cost[i] = sc.nextInt();  
            m = sc.nextInt();  
            for (int i = 1; i <= m; i++) {  
                int u = sc.nextInt();  
                int v = sc.nextInt();  
                if (u > v) {  
                    int t = u;  
                    u = v;  
                    v = t;  
                }  
                g[u].add(v);  
            }  
            Arrays.fill(dp, 0);  
            Arrays.fill(pre, -1);  
            for (int i = 1; i <= n; i++) {  
                int u = i;  
                for (int j = 0; j < g[i].size(); j++) {  
                    int v = g[i].get(j);  
                    if (dp[u] + cost[v] > dp[v]) {  
                        dp[v] = dp[u] + cost[v];  
                        pre[v] = u;  
                    }  
                }  
            }  
            System.out.println("CASE " + (ca++) + "#");  
            System.out.println("points : " + dp[n + 1]);  
            System.out.print("circuit : ");  
            int cnt = 0;  
            int p = n + 1;  
            while (p != -1) {  
                rec[cnt++] = p;  
                p = pre[p];  
            }  
            for (int i = cnt - 1; i > 0; i--)  
                System.out.print(rec[i] + "->");  
            System.out.println("1");  
            if (_ != 0)  
                System.out.println();  
        }  
    }  
}  


HDU 1224 Free DIY Tour(最短路或DP)
阅读更多
想对作者说点什么?

博主推荐

换一批

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