Alignment(dp)

http://poj.org/problem?id=1836

求两遍最长上升子序列，顺序求一遍，逆序求一遍。

#include <stdio.h>
#include <string.h>
const int N=1002;
int dp1[N],dp2[N];
double a[N];
int main()
{
    int n;
    scanf("%d",&n);
    for (int i = 1; i <= n; i++)
    {
        scanf("%lf",&a[i]);
    }
    dp1[1] = 1;
    for (int i = 2; i <= n; i++)
    {
        int temp = 0;
        for (int j = 1; j < i; j++)
        {
            if (a[i] > a[j])
            {
                if (temp < dp1[j])
                    temp = dp1[j];
            }
        }
        dp1[i] = temp+1;
    }
    dp2[n] = 1;
    for (int i = n-1; i > 0; i--)
    {
        int temp =  0;
        for (int j = n; j > i; j--)
        {
            if (a[i] > a[j])
            {
                if (temp < dp2[j])
                    temp = dp2[j];
            }
        }
        dp2[i] = temp+1;
    }
    int Max = 0;
    for (int i = 1; i <= n; i++)
    {
        for (int j = i+1; j <= n; j++)
        {
            if (Max < dp1[i]+dp2[j])
                Max = dp1[i]+dp2[j];
        }
    }
    printf("%d
",n-Max);
    return 0;
}