本文主要是介绍九度1131_合唱队形【LIS】【LCS】，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
题目1131：合唱队形# include<stdio.h>
# include<string.h>int array[110],f_up[110],f_down[110];int main()
{int N;while(~scanf("%d",&N)) {memset(array,0,sizeof(array));memset(f_up,0,sizeof(f_up));memset(f_down,0,sizeof(f_down));for(int i = 1; i <= N; i++)scanf("%d",&array[i]);for(int i = 1; i <= N; i++){f_up[i] = 1;f_down[i] = 1;}f_up[0] = f_up[N+1] = 0;f_down[0] = f_down[N+1] = 0;for(int i = 1; i <= N; i++){for(int j = i-1; j>=1; j--){if(array[i] > array[j] && f_up[i]<f_up[j]+1)f_up[i] = f_up[j] + 1;}} for(int i = N; i >= 1; i--){for(int j = i+1; j <= N; j++){if(array[i] > array[j] && f_down[i]<f_down[j]+1)f_down[i] = f_down[j] + 1;}}int ans = 0;for(int i = 1; i <= N; i++){if(ans < f_up[i]+f_down[i]-1)ans = f_up[i] + f_down[i]-1;}printf("%d\n",N-ans);}return 0;
}
这篇关于九度1131_合唱队形【LIS】【LCS】的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
