poj1836 Alignment
2013-05-01 15:11
323 查看
#include<iostream> #include<cstring> #include<cstdio> using namespace std; int f1[1001],f2[1001]; double a[1001]; int main(){ int n; int i,j,k; scanf("%d",&n); for(i=1;i<=n;i++) scanf("%lf",&a[i]); for(i=1;i<=n;i++) f1[i]=f2[i]=1; for(i=2;i<=n;i++) for(j=1;j<i;j++) if(a[j]<a[i]) if(f1[j]+1>f1[i]) f1[i]=f1[j]+1; for(i=n-1;i>=1;i--) for(j=n;j>i;j--) if(a[j]<a[i]) if(f2[j]+1>f2[i]) f2[i]=f2[j]+1; int maxx=0; for(i=2;i<=n;i++) if(f1[i]<f1[i-1]) f1[i]=f1[i-1]; for(i=n-1;i>=1;i--) if(f2[i]<f2[i+1]) f2[i]=f2[i+1]; for(i=1;i<n;i++) if(f1[i]+f2[i+1]>maxx) maxx=f1[i]+f2[i+1]; printf("%d\n",n-maxx); return 0; }
相关文章推荐
- POJ 1836 Alignment
- POJ 1836 Alignment
- poj 1836 Alignment
- poj 1836 Alignment
- Alignment(POJ--1836
- poj-1836-Alignment
- POJ 1836 Alignment(LIS和LDS的结合题)
- poj-1836 Alignment
- POJ 1836 Alignment
- POJ-1836-Alignment
- POJ 1836 Alignment
- POJ 1836 Alignment
- POJ 1836 Alignment(DP | LIS)
- POJ 1836.Alignment
- POJ 1836 Alignment
- POJ - 1836 Alignment (最长上升子序列 O(nlogn))
- poj 1836 Alignment (最长上升子序列 N*log(n))@
- 【动态规划】【poj 1836】Alignment
- POJ 1836 Alignment(LIS)
- [POJ 1836]Alignment[DP][LIS]