Time Limit: 1000MS | | Memory Limit: 65536K |
Total Submissions: 1433 | | Accepted: 627 |
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 1 , ... , 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 B 1 , . ... , 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
Source
题目大意:
将n个给定的高度增加或者减少,使最后的序列非降序,求变化的最小值。
1.离散化,给我的感觉就是记录某个高度及所对应的rank值。
2.dp[i][j] 表示的是前i个全部排好序,最后一个变成整个序列中第j大的时候的最优值(强大******!)
3.
那么 dp[i][j] = dp[i-1][k](k>=0&&k<=j) + dif(i,rank[j]);
若用一维表示,则类似于背包的一维求解过程。(强大!!!!!!!!!!!!!!!!!)
dp[j]表示当前的点变为第j大时候的最优值。那么前面dp[i-1][k](k<=j)的所有值不需要记录,只需要记录这中间最优的一个即可。
所以变成了n^2.!