题目:hdu1260
题意:每个人去买花,要么两个人一起买用一个时间,要么一个人一个人单独买,问总共的最少的时间
解答:简单dp。状态转移方程dp[i+1] = min(dp[i]+a[i+1],dp[i-1]+b[i]);
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
const int MAXN = 2010;
int dp[2010];
int a[MAXN];
int b[MAXN];
void puts(int t)
{
t %= 86400;
int h = t / 3600;
int m = (t % 3600) / 60;
int s = (t % 3600) % 60;
bool flag = 1;
if(h >= 12)
flag = 0;
int x,y,z;
x = (8 + h) % 12;
y = m;
z = s;
printf("%02d:",x);
printf("%02d:",y);
printf("%02d ",z);
if(flag)
puts("am");
else
puts("pm");
return;
}
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int n;
scanf("%d",&n);
for(int i = 1;i <= n;i++)
scanf("%d",&a[i]);
for(int i = 1;i <= n-1;i++)
scanf("%d",&b[i]);
dp[1] = a[1];
for(int i = 1;i <= n-1;i++)
{
dp[i+1] = min(dp[i]+a[i+1],dp[i-1]+b[i]);
}
puts(dp[n]);
}
return 0;
}