【Codeforces】 489E Hiking

直接DP是错的。。。。要二分，然后用dp判断是否正确。。。

#include <iostream>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 3005
#define maxm 300005
#define eps 1e-10
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
//#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

struct node
{
	double x, b;
}p[maxn];
double dp[maxn];
int pre[maxn];
int n,m;

void read(void)
{
	scanf("%d%d", &n, &m);
	p[0].x = p[0].b = 0;
	for(int i = 1; i <= n; i++) scanf("%lf%lf", &p[i].x, &p[i].b);
}

bool check(double x)
{
	memset(dp, 0, sizeof dp);
	memset(pre, -1, sizeof pre);
	for(int i = 1; i <= n; i++) {
		dp[i] = -1e16;
		for(int j = i-1; j >= 0; j--) {
			double t = dp[j] + x * p[i].b - sqrt(abs(p[i].x - p[j].x - m));
			if(t > dp[i]) {
				dp[i] = t;
				pre[i] = j;
			}
		}
	}
	if(dp[n] > 0) return true;
	else return false;
}

void print(int u)
{
	if(u == 0) return;
	print(pre[u]);
	printf("%d%c", u, u == n ? '\n' : ' ');
}

void work(void)
{
	double bot = 0, top = 1e7, mid;
	while(top - bot > eps) {
		mid = (bot + top) / 2;
		if(check(mid)) top = mid;
		else bot = mid;
	}
	check(mid);
	print(n);
	//printf("%.9f\n", mid);
}

int main(void)
{
	read();
	work();

	return 0;
}