description
排版是很有讲究的。假设稿纸的宽度是W个字符,长度不限,当你对一篇文章排版时,必须满足以下条件:
1.必须保持单词的次序。下图显示了对4个单词“This is a pen”在一张宽11字符的稿纸上排版的结果:
analysis
-
输出 1 1 1就有 53 p t s 53pts 53pts, O ( n 2 ) O(n^2) O(n2)就有 98 p t s 98pts 98pts,哦呵
-
设 f [ i ] f[i] f[i]表示第 i i i个单词作为某行最后一个单词可行的最小空格长度
-
明显 f [ i ] f[i] f[i]可从似乎是 n n n个状态转移得到,但是……
-
于是限制枚举范围就能过,
而且方法很严谨 -
说白了就是有点东西的水法
code
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define MAXN 50005
#define INF 1000000007
#define ll long long
#define fo(i,a,b) for (ll i=a;i<=b;++i)
#define fd(i,a,b) for (ll i=a;i>=b;--i)
using namespace std;
ll a[MAXN],f[MAXN],sum[MAXN];
ll n,m,w,ans=INF,tmp;
inline ll read()
{
ll x=0,f=1;char ch=getchar();
while (ch<'0' || '9'<ch){if (ch=='0')f=-1;ch=getchar();}
while ('0'<=ch && ch<='9')x=x*10+ch-'0',ch=getchar();
return x*f;
}
inline ll max(ll x,ll y){return x>y?x:y;}
inline ll min(ll x,ll y){return x<y?x:y;}
int main()
{
w=read(),n=read();
fo(i,1,n)sum[i]=sum[i-1]+(a[i]=read());
memset(f,100,sizeof(f)),f[0]=1;
fo(i,2,n)
{
while (sum[i]-sum[tmp]+(i-tmp-1)>w && tmp<=i-2)++tmp;
fo(j,tmp,min(i-2,tmp+50))
{
ll p=(w-(sum[i]-sum[j]))/(i-j-1);
if ((w-(sum[i]-sum[j]))%(i-j-1))++p;
p=max(p,f[j]),f[i]=min(p,f[i]);
}
}
fd(i,n-1,0)
{
if (sum[n]-sum[i]+n-i-1>w)break;
ans=min(ans,f[i]);
}
printf("%lld\n",ans);
return 0;
}