诗人小G[决策单调性][四边形不等式优化][单调栈]

题目

Luogu
决策单调性二分

思路

$f_i=min(f_j+cal(i,j))$
然后 $cal$ 有决策单调性，单调栈实现

代码

#include<set>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include <iomanip>
#include<climits>
#include<cstdlib>
#include<iostream>
#include<algorithm>
using namespace std;
#define LL long long
#define LD long double
int read(){
	int f=0,x=0;char c=getchar();
	while(c<'0'||'9'<c){if(c=='-')f=1;c=getchar();}
	while('0'<=c&&c<='9') x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return !f?x:-x;
}
#define mp make_pair
const int MAXN=100000;
LD Pow(LD x,int y){
	LD ret=1;
	while(y){
		if(y&1) ret*=x;
		x*=x,y>>=1;
	}
	return ret;
}
struct node{
	int p,l;
}Q[MAXN+5];
int k;
string str[MAXN+5];
int pre[MAXN+5];
LD L,f[MAXN+5],s[MAXN+5];
LD Cal(int i,int j){return f[j]+Pow(abs(s[i]-s[j]-L),k);}
void DFS(int t){
	if(!t) return ;
	DFS(pre[t]);
	for(int i=pre[t]+1;i<=t;i++)
		cout<<str[i],putchar(i==t?'\n':' ');
	return ;
}
int main(){
	int T=read();
	while(T--){
		int n=read();
		L=read()+1,k=read();
		for(int i=1;i<=n;i++)
			cin>>str[i],s[i]=s[i-1]+str[i].length();
		for(int i=1;i<=n;i++)
			s[i]+=i;
		int head=0,tail=1;
		Q[++head]=(node){0,1};
		for(int i=1;i<=n;i++){
			f[i]=Cal(i,Q[head].p),pre[i]=Q[head].p;
			if(i==n) break;
			Q[head].l++;
			if(head<tail&&Q[head].l==Q[head+1].l)
				head++;
			if(Cal(n,Q[tail].p)<Cal(n,i))
				continue;
			while(head<=tail&&Cal(Q[tail].l,Q[tail].p)>=Cal(Q[tail].l,i))
				tail--;
			if(head<=tail){
				int L=Q[tail].l,R=n+1;
				while(L+1<R){
					int Mid=(L+R)>>1;
					if(Cal(Mid,Q[tail].p)>=Cal(Mid,i)) R=Mid;
					else L=Mid;
				}
				Q[++tail]=(node){i,R};
			}
			else Q[++tail]=(node){i,i+1};
		}
		if(f[n]>1e18){
			puts("Too hard to arrange");
			puts("--------------------");
			continue;
		}
		cout<<(LL)f[n]<<endl;
		DFS(n);
		puts("--------------------");
	}
	return 0;
}