zoukankan      html  css  js  c++  java
  • 线性DP POJ3666 Making the Grade

    Making the Grade
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 7347   Accepted: 3415

    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 A1, ... , AN (1 ≤ N ≤ 2,000) describing the elevation (0 ≤ Ai ≤ 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 B1, . ... , BN 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

    |A1 - B1| + |A2 - B2| + ... + |AN - BN |

    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: Ai

    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

     
    引理一下,记|Ai-Bi|的和为S,在S最小化前提下,一定存在一种构造序列B的方案,使B中的数值都在A中出现过。
    然后很容易做了……
    附lyd的讲解
     

    对于这个引理,简单地证明一下:

    可以用数学归纳法证明。

    假设b[1~k-1]都在a[]中出现过;

    对于b[k],若a[k]>b[k-1],则b[k]=a[k]解最优;

          若a[k]<b[k-1],则一定存在t,使b[t~k]变为a[k]的最优解;

                 或b[k]=b[k-1];

    特殊地,对于1号位置,b[1]=a[1]必定为最优解。

    综上,引理显然得证。

    接下来进行dp

    代码
     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cstring>
     4 #include<algorithm>
     5 #include<cmath>
     6 using namespace std;
     7 int n;
     8 int a[2010],num[2010],f[2010][2010];
     9 int main(){
    10     scanf("%d",&n);
    11     for(int i=1;i<=n;i++) scanf("%d",&a[i]),num[i]=a[i];
    12     sort(num+1,num+n+1);
    13     memset(f,0x3f3f3f3f,sizeof(f));
    14     f[0][0]=0;
    15     int tmp=0;
    16     for(int i=1;i<=n;i++){
    17         tmp=f[i-1][0];
    18         for(int j=1;j<=n;j++){
    19             tmp=min(tmp,f[i-1][j]);
    20             f[i][j]=abs(a[i]-num[j])+tmp;    
    21         }
    22     }
    23     int ans=0x3f3f3f3f;
    24     for(int i=1;i<=n;i++)
    25         ans=min(ans,f[n][i]);
    26     printf("%d
    ",ans);
    27     return 0;
    28 }
  • 相关阅读:
    Oracle学习笔记:在ubuntu 8.10 Sever上 安装oracle10g,真真正正简简单单的解决‘utilities ctx_on‘错误
    Oracle学习笔记:oracle服务在linux平台的启动问题
    非常酷的 Javascript 简单调试工具Blackbird
    【转】Smashing Magazine CSS3 设计赛获奖作品
    Windows7 IIS7下以FastCgi和ISAPI方法安装配置PHP5教程
    推荐60多个CSS GALLERY画廊网站
    【转】2010全球最值得模仿的230个网站
    Godaddy免费空间WordPress使用记录
    【转】浅谈大型网站动态应用系统架构
    你可能不知道的10个JavaScript小技巧
  • 原文地址:https://www.cnblogs.com/zwube/p/7107967.html
Copyright © 2011-2022 走看看