[CF1101F]Trucks and Cities

题目

传送门 to luogu

思路

原本以为是二分答案。

没想到题目可以理解为 划分成 $r+1$ 段，使得最大值最小。

这显然是个贪心的思路。然后就可以区间 $\mathtt{d}\mathtt{p}$ 了。

结果写出来一个 $\mathcal{O}(n^4)$ 的方程式

f ( l , r , k ) = min ⁡ i = l r − 1 max ⁡ { f ( l , i , k − 1 ) , a r − a i } f(l,r,k)=\min_{i=l}^{r-1}\max\{f(l,i,k-1),a_r-a_i\} f(l,r,k)=i=lminr−1​max{f(l,i,k−1),ar​−ai​}

事实上可以优化，因为 $f(l,i,k-1)$ 单增，而 $a_r-a_i$ 单减。我们可以找到这个山谷的谷底。而且在 $r$ 增大时，谷底只会右移。我们就可以优化至 $\mathcal{O}(n^3)$ 了。

代码

#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
inline int readint(){
	int a = 0; char c = getchar(), f = 1;
	for(; c<'0'||c>'9'; c=getchar())
		if(c == '-') f = -f;
	for(; '0'<=c&&c<='9'; c=getchar())
		a = (a<<3)+(a<<1)+(c^48);
	return a*f;
}
template < class T >
void getMax(T&a,T b){ if(a < b) a = b; }
template < class T >
void getMin(T&a,T b){ if(b < a) a = b; }

const int MaxN = 405;
int dp[2][MaxN][MaxN], a[MaxN];
struct Car{
	int s, t, c, r;
	void input(){
		s = readint(), t = readint();
		c = readint(), r = readint();
	}
	bool operator < (const Car &x) const {
		return r < x.r;
	}
} car[MaxN*MaxN<<1];

# define HERE 1ll*dp[k&1][car[qid].s][car[qid].t]

int main(){
	int n = readint(), m = readint();
	for(int i=1; i<=n; ++i)
		a[i] = readint();
	for(int i=1; i<=m; ++i){
		car[i].input();
		getMin(car[i].r,n-1);
	}
	sort(car+1,car+m+1);
	for(int i=1; i<=n; ++i)
		for(int j=i; j<=n; ++j)
			dp[1][i][j] = a[j]-a[i];
	int qid = 1; long long ans = 0;
	for(int k=1; qid<=m&&!car[qid].r; ++qid)
		getMax(ans,HERE*car[qid].c);
	for(int k=2; k<=n; ++k){
		for(int i=1; i<=n; ++i)
		for(int j=i,p=i; j<=n; ++j){
			while(p <= j)
				if(dp[(k&1)^1][i][p] < a[j]-a[p])
					++ p; else break;
			dp[k&1][i][j] = min(a[j]-a[p-1],
				dp[(k&1)^1][i][p]);
		}
		for(; qid<=m&&car[qid].r+1==k; ++qid){
			getMax(ans,HERE*car[qid].c);
// printf("%d -> %d, %d times, gas: %lld\n",car[qid].s,car[qid].t,car[qid].r,HERE*car[qid].c);
		}
	}
	printf("%lld\n",ans);
	return 0;
}

后记

我试了试二分的方法，果然是不行。

#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
inline int readint(){
	int a = 0; char c = getchar(), f = 1;
	for(; c<'0'||c>'9'; c=getchar())
		if(c == '-') f = -f;
	for(; '0'<=c&&c<='9'; c=getchar())
		a = (a<<3)+(a<<1)+(c^48);
	return a*f;
}
template < typename T >
void getMax(T&a,T b){ if(a < b) a = b; }
template < typename T >
void getMin(T&a,T b){ if(b < a) a = b; }

const int MaxN = 405;
int a[MaxN], n, m;
struct Car{
	int s, t, c, r;
	void input(){
		s = readint(), t = readint();
		c = readint(), r = readint();
	}
	bool operator < (const Car &x) const {
		return r < x.r;
	}
} car[MaxN*MaxN<<1];

bool check(long long V){ // 油箱容量
	for(int i=1; i<=m; ++i){
		if(V/car[i].c < (a[car[i].t]-a[car[i].s]+car[i].r)/(car[i].r+1))
			return false; // 总里程没凑足
		int now = car[i].s;
		for(int t=0; t<=car[i].r; ++t){
			if(V/car[i].c < a[now+1]-a[now])
				return false; // 寸步难行
			now = lower_bound(a+1,a+n+1,V/car[i].c+a[now]+1)-a;
			if((-- now) >= car[i].t) break;
		}
		if(now < car[i].t) return false;
	}
	return true;
}

int main(){
	n = readint(), m = readint();
	for(int i=1; i<=n; ++i)
		a[i] = readint();
	for(int i=1; i<=m; ++i){
		car[i].input();
		getMin(car[i].r,n-1);
	}
	sort(car+1,car+m+1);
	long long L = 0, R = 1ll<<60;
	while(L < R)
		if(check((L+R)>>1))
			R = (L+R)>>1;
		else L = (L+R)/2+1;
	printf("%lld\n",L);
	return 0;
}