题目:
Making the Grade
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 12460 | Accepted: 5740 |
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
分析:
dp[i][j]表示对于第i个元素来说,高为j时的最小花费,转移方程:dp[i][j] = (min)dp[i - 1][k](k:= 1 to j) + abs(j - v[i]);
很显然,j的范围会导致tle;因此需要对j进行离散化:j一定是从题目输入的值里面选取(证明略,可从分类讨论的角度证明),然后每次用minn维护等号右边的最小值即可
代码:
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int maxn = 2010;
ll dp[maxn][maxn];
ll a[maxn], b[maxn];
int main()
{
int n; cin >> n;
ll res = inf;
for (int i = 1; i <= n; i++)
{
scanf("%lld", a + i);
b[i] = a[i];
}
sort(b + 1, b + 1 + n);
for (int i = 1; i <= n; i++)
{
ll minn = dp[i - 1][1];
for (int j = 1; j <= n; j++)
{
minn = min(minn, dp[i - 1][j]);
dp[i][j] = abs(a[i] - b[j]) + minn;
}
}
for (int i = 1; i <= n; i++)
res = min(res, dp[n][i]);
cout << res << endl;
}