UESTC - 594 我要长高

他们oj挂掉啦， 我先保存一下代码。。。

直接dp复杂度， n * 100 * 100， 我们可以将前一个人的信息丢进单调队列中去，可以优化成n * 100;

#include<bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mk make_pair
#define pii pair<int,int>
#define piii pair<int, pair<int,int> >

using namespace std;

const int N = 5e4 + ;
const int M =  + ;
const int inf = 0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + ;
const double eps = 1e-;

int n, c, head1, head2, rear1, rear2;
int sk1[N], sk2[N], a[N], dp[N][];

void init() {
    for(int i = ; i <= n; i++) {
        for(int j = ; j <= ; j++) {
            dp[i][j] = inf;
        }
    }
    head1 = head2 = ;
    rear1 = rear2 = ;
}
int main() {
    while(scanf("%d%d", &n, &c) != EOF) {

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

        for(int j = a[]; j <= ; j++) {
            dp[][j] = (j - a[]) * (j - a[]);
        }

        for(int i = ; i <= n; i++) {

            rear1 = rear2 = ;
            head1 = head2 = ;

            for(int j = ; j <= ; j++) {

                while(head1 < rear1 && dp[i - ][j] + c * j < dp[i - ][sk1[rear1 - ]] + c * sk1[rear1 - ]) rear1--;
                sk1[rear1++] = j;
            }

            for(int j = ; j >= ; j--) {

                while(head2 < rear2 && dp[i - ][j] - c * j < dp[i - ][sk2[rear2 - ]] - c * sk2[rear2 - ]) rear2--;
                sk2[rear2++] = j;
            }

            for(int j = a[i]; j <= ; j++) {
                while(head1 < rear1 && sk1[head1] < j) head1++;
                if(head1 < rear1) dp[i][j] = dp[i - ][sk1[head1]] + c * sk1[head1] + (j - a[i]) * (j - a[i]) - c * j;
            }

            for(int j = ; j >= a[i]; j--) {
                while(head2 < rear2 && sk2[head2] > j) head2++;
                if(head2 < rear2) dp[i][j] = min(dp[i][j], dp[i - ][sk2[head2]] - c * sk2[head2] + (j - a[i]) * (j - a[i]) + c * j);
            }
        }

        int ans = inf;
        for(int j = a[n]; j <= ; j++) {
            ans = min(ans, dp[n][j]);
        }
        printf("%d\n", ans);
    }
    return ;
}
/*
*/