zoukankan      html  css  js  c++  java
  • Making the Grade POJ

    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

    | A 1 - B 1| + | A 2 - B 2| + ... + | 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
    真是傻,5555555555
    dp[i][j]表示1~i这段变成非递减数列且末尾是b[j]所需要的最小花费。之所以用b[j],是因为改变过后的数一定会在原来的数列中出现(好厉害),不过我????。
     1 #include<iostream>
     2 #include<algorithm>
     3 #include<cstdio>
     4 #include<cstring>
     5 using namespace std;
     6 typedef long long ll;
     7 
     8 const int maxn=2005;
     9 
    10 int n;
    11 int a[maxn],b[maxn];
    12 ll dp[maxn][maxn];
    13 
    14 void solve(){
    15     memset(dp,0,sizeof(dp));
    16     for(int i=1;i<=n;i++){
    17         ll temp=dp[i-1][1];
    18         for(int j=1;j<=n;j++){
    19             temp=min(temp,dp[i-1][j]);
    20             dp[i][j]=abs(b[j]-a[i])+temp;
    21         }
    22     }
    23     ll ans=dp[n][1];
    24     for(int i=2;i<=n;i++) ans=min(ans,dp[n][i]);
    25     cout<<ans<<endl;
    26 }
    27 
    28 int main()
    29 {   cin>>n;
    30     for(int i=1;i<=n;i++){ cin>>a[i]; b[i]=a[i]; }
    31     sort(b+1,b+n+1);
    32     solve();
    33     
    34     return 0;
    35 }
    36  
  • 相关阅读:
    基于sshpass批量实现主机间的key验证脚本
    一键安装mysql5.7.30脚本
    centos8网卡名称修改
    mysql分库备份脚本
    centos一键二进制编译安装mariadb-10.2.31脚本
    chrony时间同步服务简介及配置
    linux基于key验证
    expect 脚本语言中交互处理常用命令
    shell中数值测试和算术表达式比较
    JAVA Math的简单运用
  • 原文地址:https://www.cnblogs.com/zgglj-com/p/7458644.html
Copyright © 2011-2022 走看看