Alignment(dp)

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

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

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