HDU 1224 Free DIY Tour 简单DP

　　　　　　　　　　　　　　　　Free DIY Tour

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 andN+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

 

 

题意：n座城市，编号为1到n，然后给出每个城市的有趣值，规定1为0

　　　再给出一些路，

　　　问现在从1沿着哪些路去旅行，再回到1，有趣值最大。

　　　

　　　而且，题目规定，从编号大的城市不能回到编号小的城市

　　　(刚开始看成有趣值大的不能到有趣值小的)

　　　这样，问题就简单的多了

　　　

　　　假设不回到1了，而是去一座城市，为n+1，其值为inf

　　　就是求一个子序列，使得这个序列的和最大

　　　最后的和再减去inf

　　　条件：有路

　　　

　　　dp[i]表示从1到i的最大有趣值

 

#include<iostream>
#include<cstring>
#include<algorithm>

using namespace std;

const int maxn=104;
const int inf=0x3f3f3f;


bool vis[maxn][maxn];           //标记2个点是否有路
int dp[maxn];                   //表示从1到i的最大值
int pre[maxn];
int poi[maxn];

void output(int cnt)
{
    if(pre[cnt]!=-1)
        output(pre[cnt]);
    cout<<cnt<<"->";
}

int main()
{
    int test;
    int cas=1;

    cin>>test;

    while(test--)
    {
        int n;
        cin>>n;

        for(int i=1;i<=n;i++)
            cin>>poi[i];

        int m;
        cin>>m;

        memset(vis,false,sizeof(vis));

        for(int i=1;i<=m;i++)
        {
            int u,v;
            cin>>u>>v;

            vis[u][v]=vis[v][u]=true;
        }

        poi[n+1]=inf;
        memset(dp,0,sizeof(dp));
        memset(pre,-1,sizeof(pre));

        for(int i=1;i<=n+1;i++)
            for(int j=1;j<i;j++)
            {
               if(vis[i][j]&&dp[i]<dp[j]+poi[i])
               {
                    dp[i]=dp[j]+poi[i];
                    pre[i]=j;
               }
            }
        
        if(cas>1)
            cout<<"
";
        
        cout<<"CASE "<<cas++<<"#"<<endl;
        cout<<"points : "<<dp[n+1]-poi[n+1]<<endl;
        cout<<"circuit : ";
        output(pre[n+1]);
        cout<<1<<endl;
    }
    return 0;
}