CodeForces 547 B (区间dp)

思路详见代码

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<deque>
#include<functional>
#include<iterator>
#include<vector>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#define CPY(A, B) memcpy(A, B, sizeof(A))
typedef long long LL;
typedef unsigned long long uLL;
const int MOD = int (1e9) + 7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const double OO = 1e20;
const double PI = acos (-1.0);
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
const int maxn=200005;
int ans[maxn];
struct DP {
    int height,left,right;
};
DP dp[maxn];
bool cmp (DP a,DP b) {
    return a.height<b.height;
}
int main() {
    int n; scanf ("%d",&n);
    for (int i=1; i<=n; i++) {
        scanf ("%d",&dp[i].height);
    }
    dp[0].height=dp[++n].height=0;
    for (int i=1; i<n; i++) {
        dp[i].left=i-1;
        while (i>0&&dp[dp[i].left].height>=dp[i].height) {
            dp[i].left=dp[dp[i].left].left;
        }//if left higher,Continue to find the left border to the left
    }
    for (int i=n-1; i>0; i--) {
        dp[i].right=i+1;
        while (i<n&&dp[dp[i].right].height>=dp[i].height) {
            dp[i].right=dp[dp[i].right].right;
        }//dp[i] is the shortest
    }
    memset (ans,-1,sizeof (ans) );
    sort (dp,dp+n,cmp);
    for (int i=1; i<n; i++) {
        int space=dp[i].right-dp[i].left-1;//区间长
        //cout<<space<<endl;
        ans[space]=max (ans[space],dp[i].height);
    }
    /*for (int i=1; i<n; i++) {
        cout<<ans[i]<<endl;
    }*/
    for (int i=n-1; i>0; i--) {
        ans[i]=max (ans[i],ans[i+1]);//再确定不同区间长度下，最高的
    }
    for (int i=1; i<n-1; i++) {
        printf ("%d ",ans[i]);
    }
    printf ("%d\n",ans[n-1]);
    return 0;
}