PAT T1017 The Best Peak Shape

动态规划找最长上升子序列，正反遍历一遍序列即可~

#include<bits/stdc++.h>
using namespace std;
const int maxn=;
int N;
int a[maxn];
int l[maxn];
int r[maxn];
int main () {
    scanf ("%d",&N);
    for (int i=;i<N;i++)
    scanf ("%d",&a[i]);
    int maxLength=;
    int maxIndex;
    int maxValue;
    int mincha;
    for (int i=;i<N;i++) {
        for (int j=i-;j>=;j--)
        if (a[j]<a[i]) l[i]=max(l[i],l[j]+);
    }
    for (int i=N-;i>=;i--) {
        for (int j=i+;j<N;j++)
        if (a[j]<a[i]) r[i]=max(r[i],r[j]+);
    }
    for (int i=;i<N;i++) {
        if (l[i]==||r[i]==) continue;
        int len=l[i]+r[i]+;
        if (len>maxLength) {
            maxLength=len;
            maxIndex=i;
            mincha=abs(l[i]-r[i]);
        }
        else if (len==maxLength&&abs(l[i]-r[i])<mincha) {
            maxIndex=i;
            mincha=abs(l[i]-r[i]);
        }
    }
    if (maxLength==) printf ("No peak shape");
    else printf ("%d %d %d",maxLength,maxIndex+,a[maxIndex]);
    return ;
}