题目连接:http://acm.hdu.edu.cn/showproblem.php?pid=5935
题目大意:起点在位置0,对应已知几个坐标,到这些坐标的时间都是整数的时间,并且保证整个路程中的行进速度是不递减的、每段的速度可以为小数,问最短时间从0到最后一个位置的时间花费。
解题思路:贪心。本质上题目很简单,但是,这题坑点巨大无比,用double存在着精度损失,必须要用分数来做(WA了一遍又一遍得来的教训)。
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
#define showtime fprintf(stderr,"time = %.15f\n",clock() / (double)CLOCKS_PER_SEC)
#define lld %I64d
#define REP(i,k,n) for(int i=k;i<n;i++)
#define REPP(i,k,n) for(int i=k;i<=n;i++)
#define scan(d) scanf("%d",&d)
#define scanl(d) scanf("%I64d",&d)
#define scann(n,m) scanf("%d%d",&n,&m)
#define scannl(n,m) scanf("%I64d%I64d",&n,&m)
#define mst(a,k) memset(a,k,sizeof(a))
#define LL long long
#define N 100005
#define mod 1000000007
inline int read(){int s=0;char ch=getchar();for(; ch<'0'||ch>'9'; ch=getchar());for(; ch>='0'&&ch<='9'; ch=getchar())s=s*10+ch-'0';return s;}
LL a[N];
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t; scan(t);
int cas = 1;
while(t--)
{
int n; scan(n);
REPP(i,1,n) scanl(a[i]);
a[0] = 0;
int ans = 0;
LL x = 1;
LL y = 2e9;
LL f;
for(int i = n; i>=1;i--)
{
if( (a[i] - a[i-1]) * x > y)
{
f = ceil( (a[i] - a[i-1]) * 1.0 * x / y);
x = f;
y = a[i] - a[i-1] ;
int k = __gcd(x,y);
x /= k;
y /= k;
ans += f ;
}
else
{
ans++;
x = 1LL;
y = a[i] - a[i-1];
}
//printf("ans = %d\n",ans);
}
printf("Case #%d: %d\n",cas++,ans);
}
return 0;
}