一、题目大意
给出一个数列A,把每一个A[i]变为B[i],使得数列B单调非增或单调非减,求最小的abs(A[i]-B[i[)总和。
二、思路
不难看出,变化后的B[i]一定来自原数列,把数列A用Set去重,之后排序,放到数组HashArray中,定义DP数组,DP[i][j]代表前i元素个子序列改成以HashArray[j]结尾的单调非减序列的最少消耗。
则 DP[i+1][j]=min(DP[i][1]+...DP[i][j]) + abs(HashArray[j]-A[i])
求出结果后,把HashArrray整个数组反转一下,再求一次,就是对原数组的单调非增序列了。
三、代码
#include <iostream>
#include <set>
#include <algorithm>
using namespace std;
typedef long long ll;
ll dp[2][2007];
int N, hashLen = 0, num[2007], hashArray[2007];
void input()
{
scanf("%d", &N);
set<int> distinctSet;
for (int i = 1; i <= N; i++)
{
scanf("%d", &num[i]);
distinctSet.insert(num[i]);
}
for (set<int>::iterator ite = distinctSet.begin(); ite != distinctSet.end(); ite++)
{
hashArray[++hashLen] = *ite;
}
sort(hashArray + 1, hashArray + hashLen + 1);
}
void handleFirst()
{
for (int j = 1; j <= hashLen; j++)
{
dp[1][j] = abs(hashArray[j] - num[1]);
}
}
void solve(int i)
{
ll preMin = -1;
for (int j = 1; j <= hashLen; j++)
{
if (preMin == -1)
{
preMin = dp[(i - 1) % 2][j];
}
else if (preMin > dp[(i - 1) % 2][j])
{
preMin = dp[(i - 1) % 2][j];
}
dp[i % 2][j] = preMin + abs(hashArray[j] - num[i]);
}
}
void doDp()
{
for (int i = 1; i <= N; i++)
{
if (i == 1)
{
handleFirst();
}
else
{
solve(i);
}
}
}
ll findAns()
{
ll ans = -1LL;
for (int i = 1; i <= hashLen; i++)
{
if (ans == -1LL)
{
ans = dp[N % 2][i];
}
else if (ans > dp[N % 2][i])
{
ans = dp[N % 2][i];
}
}
return ans;
}
bool gtCompare(int a, int b)
{
return a > b;
}
int main()
{
input();
doDp();
ll ansUp = findAns();
sort(hashArray + 1, hashArray + hashLen + 1, gtCompare);
doDp();
ll ansDown = findAns();
printf("%lld\n", min(ansUp, ansDown));
return 0;
}