[poj3666]Making the Grade

Making the Grade

(简洁题意请往下翻)

Description

A straight dirt road connects two fields on FJ's farm, but it changes elevation more than FJ would like. His cows do not mind climbing up or down a single slope, but they are not fond of an alternating succession of hills and valleys. FJ would like to add and remove dirt from the road so that it becomes one monotonic slope (either sloping up or down).

You are given N integers A₁, ... , A_N (1 ≤ N ≤ 2,000) describing the elevation (0 ≤ A_i ≤ 1,000,000,000) at each of N equally-spaced positions along the road, starting at the first field and ending at the other. FJ would like to adjust these elevations to a new sequence B₁, . ... , B_N that is either nonincreasing or nondecreasing. Since it costs the same amount of money to add or remove dirt at any position along the road, the total cost of modifying the road is

|A₁ - B₁| + |A₂ - B₂| + ... + |A_N - B_N |

Please compute the minimum cost of grading his road so it becomes a continuous slope. FJ happily informs you that signed 32-bit integers can certainly be used to compute the answer.

Input

* Line 1: A single integer: N
* Lines 2..N+1: Line i+1 contains a single integer elevation: A_i

Output

* Line 1: A single integer that is the minimum cost for FJ to grade his dirt road so it becomes nonincreasing or nondecreasing in elevation.

Sample Input

7
1
3
2
4
5
3
9

Sample Output

3

Source

USACO 2008 February Gold

 

 

 

题意:

A[i]为输入序列,B[i]为构造序列.

构造非严格单调序列B[i],使sigma | A[i]-B[i] | 最小

 

引理:构造出的B[i]一定在A[i]中出现过.(感性理解一下)

 

[题解]

最开始想到O(n^3)的dp:

f[i]表示B[i]=A[i]时,最小花费.

状态转移方程:

cost(j,i)表示将j~i中一段变成A[j],剩下的变成A[i](连续的)的最小花费,需要O(n)统计

 

然后,这个dp是可以优化的:

将A中数字离散化(并去重),f[i][j]表示B[i]=b[j]时的最小花费(b[j]是哈希数组,从小到大排序,与下面AC代码中的b数组含义相同)

这样可以用minf数组统计出f[i][1],f[i][2]......f[i][j]中的最小值,可以做到O(1)转移

状态转移方程见代码.

#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
#define maxn 2001
#define mLL 0x7f7f7f7f7f7f7f7f
using namespace std;
int n,num[maxn];
//f[i]为A[i]与B[i]相同时,构成序列1-i的最小花费
ll f[maxn],ans1=mLL,ans2=mLL;
int cost(int j,int i){//将j+1~i-1区间内的左边一部分数改成A[i],右边一部分改成A[j]
    int tmp=0;
    for(int k=j+1;k<i;k++)
        tmp+=abs(num[k]-num[j]);
    int ret=tmp;
    for(int k=i-1;k>j;k--){
        tmp=tmp-abs(num[k]-num[j])+abs(num[k]-num[i]);
        ret=min(ret,tmp);
    }
    return ret;
}
void debug(){
    int a,b;
    while(scanf("%d%d",&a,&b)!=EOF){
        printf("%d
",cost(a,b));
    }
    return;
}
int main(){
    scanf("%d",&n); 
    for(int i=1;i<=n;i++)
        scanf("%d",&num[i]);
    memset(f,0x7f,sizeof(f));
    f[1]=0;
    for(int i=1;i<=n;i++)//B[i]=A[i]
        for(int j=1;j<i;j++)
            if(num[j]<=num[i]) f[i]=min(f[i],f[j]+cost(j,i));
    for(int i=1;i<=n;i++)
        ans1=min(ans1,f[i]+cost(i,n));
    memset(f,0x7f,sizeof(f));
    f[1]=0;
    for(int i=1;i<=n;i++)
        for(int j=1;j<i;j++)
            if(num[j]>=num[i]) f[i]=min(f[i],f[j]+cost(i,j));
    for(int i=1;i<=n;i++)
        ans2=min(ans2,f[i]+cost(i,n));
    printf("%lld
",min(ans1,ans2));
    // debug();
    return 0;
}

#include <cstdio>
#include <cstring>
#include <algorithm>
#define maxn 2001
#define ll long long
using namespace std;
ll f[maxn][maxn],minf[maxn][maxn],ans=0x7f7f7f7f7f7f7f7f;
int n,m,a[maxn],b[maxn];//b:hash
void dp(){
    memset(f,0x3f,sizeof(f));
    memset(minf,0x3f,sizeof(minf));
    memset(minf[0],0,sizeof(minf[0]));
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){//去重后的数字,从小到大排序
            f[i][j]=min(f[i][j],minf[i-1][j]+abs(a[i]-b[j]));
            minf[i][j]=min(minf[i][j-1],f[i][j]);
        }
    }
    ans=min(ans,minf[n][m]);
}
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]),b[i]=a[i];
    sort(b+1,b+1+n);
    m=unique(b+1,b+1+n)-(b+1);
    dp();
    for(int i=1;i<=m/2;i++)
        swap(b[i],b[m-i+1]);
    dp();
    printf("%lld
",ans);
    return 0;
}