kuangbin专题十二 HDU1260 Tickets （dp）

Tickets

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

Problem Description

Jesus, what a great movie! Thousands of people are rushing to the cinema. However, this is really a tuff time for Joe who sells the film tickets. He is wandering when could he go back home as early as possible.
A good approach, reducing the total time of tickets selling, is let adjacent people buy tickets together. As the restriction of the Ticket Seller Machine, Joe can sell a single ticket or two adjacent tickets at a time.
Since you are the great JESUS, you know exactly how much time needed for every person to buy a single ticket or two tickets for him/her. Could you so kind to tell poor Joe at what time could he go back home as early as possible? If so, I guess Joe would full of appreciation for your help.

Input

There are N(1<=N<=10) different scenarios, each scenario consists of 3 lines:
1) An integer K(1<=K<=2000) representing the total number of people;
2) K integer numbers(0s<=Si<=25s) representing the time consumed to buy a ticket for each person;
3) (K-1) integer numbers(0s<=Di<=50s) representing the time needed for two adjacent people to buy two tickets together.

Output

For every scenario, please tell Joe at what time could he go back home as early as possible. Every day Joe started his work at 08:00:00 am. The format of time is HH:MM:SS am|pm.

Sample Input

2
2
20 25
40
1
8

Sample Output

08:00:40 am
08:00:08 am

 

 

题目大意：给出n个人，n个数表示每人单买的价格，n-1个数，表示相邻的两个人合买的价格。

思路：画了画，感觉挺难的。然后深搜写了，感觉得记忆化，然后发现可以用dp[pos], 表示到达该点之前的所有和的最小值。（具体见注释）

dp递推的状态方程没有写出来。

dp[i] = minn(dp[i-1] + a[i], dp[i-2] + b[i-1])  // 单人，双人

 #include <iostream>
 #include <stdio.h>
 #include <math.h>
 #include <string.h>
 #include <stdlib.h>
 #include <string>
 #include <vector>
 #include <set>
 #include <map>
 #include <queue>
 #include <algorithm>
 #include <sstream>
 #include <stack>
 using namespace std;
 #define mem(a,b) memset((a),(b),sizeof(a))
 #define mp make_pair
 #define pb push_back
 #define fi first
 #define se second
 #define sz(x) (int)x.size()
 #define all(x) x.begin(),x.end()
 typedef long long ll;
 const int inf = 0x3f3f3f3f;
 const ll INF =0x3f3f3f3f3f3f3f3f;
 const double pi = acos(-1.0);
 const double eps = 1e-;
 const ll mod = 1e9+;
 //head
 int n, a[], b[], minn, dp[];
 void dfs(int pos, int sum) {
     if(pos >= n) {//如果pos >= n
         if(sum < minn)
             minn = sum;//更新minn
         return;
     }
     if(sum >= dp[pos]) //如果达到pos的sum 比之前到达的还大，没有必要再搜索了
         return;
     dp[pos] = sum;//更新dp[pos]
     dfs(pos+, sum + a[pos]);
     dfs(pos+, sum + b[pos]);
 }

 int main() {
     int t;
     while(~scanf("%d", &t)) {
         while(t--) {
             scanf("%d", &n);
             minn = inf;
             for(int i = ; i < n; i++)
                 scanf("%d", &a[i]);
             for(int i = ; i < n-; i++)
                 scanf("%d", &b[i]);
             b[n-] = a[n-];//手动添加一个
             fill(dp, dp + n, inf);//初始化inf
             dfs(, );//dfs(pos, sum)
             int h, m, s;//时间处理
             h = minn / ;
             m = (minn - h * ) / ;
             s = minn % ;
             printf("%02d:%02d:%02d ",  + h, m, s);
             if(h < )
                 printf("am\n");
             else if(h ==  && (m + s) == )
                 printf("am\n");
             else
                 printf("pm\n");
         }
     }
 }