【CF 713C】Sonya and Problem Wihtout a Legend（离散化+dp）<POJ 3666变形>

【CF 713C】Sonya and Problem Wihtout a Legend（离散化+dp）

说是变形，其实不如说是3666的半个问题+小转弯……

3666是求不严格的单调递增或递减，刚写完blog。
这题求严格单调递增。

3666是保证$a[i] - a[j] >= 0 \ \ (i >= j)$
这题其实是保证$a[i] - a[j] >= i-j \ \ (i >= j)$
也就是$a[i]-i >= a[j]-j \ \ (i >= j)$……
然后其他的在隔壁日志写了

代码如下：

#include <iostream>
#include <cmath>
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <climits>
#include <ctime>
#include <cstring>
#include <queue>
#include <stack>
#include <list>
#include <algorithm>
#include <map>
#include <set>
#define LL long long
#define Pr pair<int,int>
#define fread(ch) freopen(ch,"r",stdin)
#define fwrite(ch) freopen(ch,"w",stdout)

using namespace std;
const int INF = 0x3f3f3f3f;
const int msz = 10000;
const int mod = 1e9+7;
const double eps = 1e-8;

LL dp[3333][3333];
int a[3333];
int b[3333];
map <int,int> mp;

int main()
{
    //fread("");
    //fwrite("");

    int n;

    scanf("%d",&n);

    for(int i = 0; i < n; ++i)
    {
        scanf("%d",&a[i]);
        a[i] -= i;
        b[i] = a[i];
    }

    sort(b,b+n);

    int id = -1;
    for(int i = 0; i < n; ++i)
    {
        if(i == 0 || b[i] != b[i-1])
        {
            id++;
            b[id] = b[i];
            mp[b[i]] = id;
        }
    }

    memset(dp,INF,sizeof(dp));

    for(int i = 0; i <= id; ++i)
    {
        dp[0][i] = abs(a[0]-b[i]);
        if(i) dp[0][i] = min(dp[0][i],dp[0][i-1]);
    }

    for(int i = 1; i < n; ++i)
    {
        for(int j = 0; j <= id; ++j)
        {
            dp[i][j] = dp[i-1][j]+abs(a[i]-b[j]);
            if(j) dp[i][j] = min(dp[i][j],dp[i][j-1]);
        }
    }

    printf("%lld\n",dp[n-1][id]);

    return 0;
}