zoukankan      html  css  js  c++  java
  • HOJ Recoup Traveling Expenses(最长递减子序列变形)

    A person wants to travel around some places. The welfare in his company can cover some of the airfare cost. In order to control cost, the company requires that he must submit the plane tickets in time order and the amount of the each submittal must be no more than the previous one. So he must arrange the travel plan according to the airfare cost. The more amount of cost covered with the welfare, the better. If the reimbursement is the same, the more times of flights, the better.

    For example, he's route is like this: G -> A-> B -> C -> D -> E -> G, and the quoted price between each destination are as follows:

     G -> A: 500
     A -> B: 300
     B -> C: 700
     C -> D: 200
     D -> E: 400
     E -> G: 100
    

    So if he flies from in the order: B -> C, D -> E, E -> G, the reimbursement should be: 

    700 + 400 + 100 = 1200 (Yuan)

    If the airfare from B to C goes down to 600 Yuan, according to the routine, the reimbursement should be 1100 Yuan. But if he chooses to travel from G -> A, A -> B, C -> D, E -> G, the reimbursement should be: 

    500 + 300 + 200 + 100 = 1100 (Yuan)

    But in this way, he gets one more flight, so this is a better plan.

    Input

    The input includes one or more test cases. The first data of each test case is N (1 <= N <= 100), followed by N airfares. Each airfare is integer, between 1 and 224.

    Output

    For one test case, output two numbers P and Q. P is the most amount of reimbursement fee. Q is the most times of flights under the circumstances of P.

    Sample Input

    1 60
    2 60 70
    3 50 20 70
    

    Sample Output

    60 1
    70 1
    70 2
    
    
    在求最长递减子序列的基础上变形一下,
    #include <iostream>
    #include <string.h>
    #include <math.h>
    #include <algorithm>
    #include <stdlib.h>
    #include <stdio.h>
    
    using namespace std;
    int n;
    int dp[105];
    int bp[105];
    int sp[105];
    int a[105];
    int ans1,ans2,ans;
    int main()
    {
        while(scanf("%d",&n)!=EOF)
        {
            for(int i=1;i<=n;i++)
                scanf("%d",&a[i]);
    
            memset(dp,0,sizeof(dp));
            memset(bp,0,sizeof(bp));
            memset(sp,0,sizeof(sp));
            ans1=0;ans2=0;ans=0;
            for(int i=1;i<=n;i++)
            {
                int num1=0;
                int num2=0;
    
                for(int j=i-1;j>=1;j--)
                {
                    if(a[i]<=a[j])
                    {
                        if(num1<dp[j]||(num1==dp[j]&&num2<bp[j]))
                        {
                            num1=dp[j];
                            num2=bp[j];
                        }
                    }
                }
                dp[i]=num1+a[i];
                bp[i]=num2+1;
                if(ans1<dp[i]||(ans1==dp[i]&&ans2<bp[i]))
                {
                    ans1=dp[i];
                    ans2=bp[i];
                }
    
            }
            printf("%d %d
    ",ans1,ans2);
        }
        return 0;
    }


    
       
    
    
  • 相关阅读:
    网络流24题
    数据结构(脑洞题,BIT):COGS 2394. 比赛
    字符串(后缀数组||SAM):NOI2015 品酒大会
    数据结构(二维线段树,差分): NOI2012 魔幻棋盘
    HNOI 2016 省队集训日记
    图论(网络流):SCOI 2007 修车
    数据结构(虚树,动态规划):HNOI 2014 世界树
    线性代数(高斯消元):JSOI2008 球形空间产生器sphere
    组合数学(Pólya计数原理):UvaOJ 10601 Cubes
    数学计数原理(Pólya,高精度):SGU 294 He's Circles
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228743.html
Copyright © 2011-2022 走看看