题目链接:http://codeforces.com/contest/760/problem/D
题意:现有三种车票,只坐一个站花20元,坐90分钟(实际是89分钟,因为在站台要花1分钟)花50元,做1440分钟(实际1439分钟)花120元,
现有n各站,要求你ti分钟要到这个站,问你到每个站最少花的钱是多少
解析:这应该就是动态规划了,dp[i]表示到第i各站花费的钱是多少,所以输出的结果是dp[i]-dp[i-1],每次更新的时候,三种值都去一下,去一下最小值即可
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
using namespace std;
const int maxn = 1e6+100;
const int inf = 0x7ffffff;
int a[maxn];
long long dp[maxn];
int main(void)
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
dp[0] = 0;
for(int i=1;i<=n;i++)
{
dp[i] = dp[i-1]+20;
int pos1 = lower_bound(a+1,a+n+1,a[i]-90+1)-a-1;
int pos2 = lower_bound(a+1,a+n+1,a[i]-1440+1)-a-1;
long long t1 = (i-pos1+1)*20;
long long t2 = (i-pos2+1)*20;
dp[i] = min(dp[i],dp[pos1]+min(50LL,t1));
dp[i] = min(dp[i],dp[pos2]+min(120LL,t2));
printf("%I64d\n",dp[i]-dp[i-1]);
}
return 0;
}