#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxn = 550;
int ind[maxn][2],ded[maxn][2],a[maxn],yu[maxn],pre[maxn];
int n;
int main()
{
while(scanf("%d",&n)==1 && n){
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
for(int i=n;i>=1;i--){
ind[i][0]=ind[i][1]=1;
for(int j=i+1;j<=n;j++){
if(a[i] < a[j]){
ind[i][0] = max......
阅读全文