[乱搞] BZOJ 1484 [HNOI2009]通往城堡之路

什么仙人掌DP啊，我好怕怕啊

题解：http://blog.csdn.net/zeyu_king/article/details/44924517

#include <cstdio>  
#include <cstring>  
#include <algorithm>  
using namespace std;  
typedef long long ll; 
 
inline char nc(){
    static char buf[100000],*p1=buf,*p2=buf;
    if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
    return *p1++;
}
  
inline void read(ll &x){
    char c=nc(),b=1;
    for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
    for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
 
const int N=5005;
 
ll n,d,ans;  
ll a[N],b[N];  
   
int main()
{
	freopen("t.in","r",stdin);
	freopen("t.out","w",stdout);
    ll Q,s,delta,tmp,minx,x;    
    read(Q);
    while (Q--)
    {   
        read(n); read(d);   
        for (int i=1;i<=n;i++) 
            read(a[i]);
        if (abs(a[n]-a[1])>(ll)(n-1)*d){ 
            printf("impossible\n"); continue;   
        }
        b[1]=a[1];
        for (int i=2;i<=n;i++)   
            b[i]=b[i-1]-d;
        while (a[n]!=b[n])
        {   
            s=0; delta=1<<30; 
            minx=1<<30; tmp=-1<<30; 
            for (int i=n;i>1;i--){   
                if (a[i]>b[i])   
                    s++,minx=min(minx,a[i]-b[i]);   
                else
                    s--;
                if (tmp<s && b[i-1]+d>b[i])   
                    tmp=s,x=i,delta=minx;   
            }
            delta=min(delta,b[x-1]+d-b[x]); 
            for (int i=x;i<=n;i++) b[i]+=delta;
        }   
        ans=0;
        for (int i=1;i<=n;i++)   
            ans+=abs(a[i]-b[i]);    
        printf("%lld\n",ans);   
    }   
    return 0;   
}