id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
4,700 | int main()
{
int num=0,k=0,n,i,j,a[50],max=0,f[50]={0};
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(i=1;i<=n;i++)
{
for(j=1;j<=i;j++)
{
if(a[i]<=a[j]&&f[i]<f[j])
{
f[i]=f[j];
}
}
f[i]++;
if(max<f[i])
{
max=f[i];
}
}
printf("%d",max);
return 0;
} | 10 |
4,701 |
void main()
{
int n,high[30],point,m,sum1,sum2,check;
scanf("%d",&n);
for (m=0;m<n;m++)
scanf("%d",&high[m]);
for(check=1;check==1;)
{
check=0;
for(point=0;point<n-1;point++)
{
if(high[point]<high[point+1])
{
check=1;
for(m=0,sum1=0;m<point;m++)
if(high[m]<high[point+1]) sum1++;
for(m=point+2,sum2=0;m<n;m++)
if(high[m]>high[point]) sum2++;
if(sum1>sum2)
{
for (m=point+1;m<n-1;m++)
{
high[m]=high[m+1];
}
}
else
{
for (m=point;m<n-1;m++)
{
high[m]=high[m+1];
}
point--;
}
n--;
}
}
}
printf("%d\n",n);
}
| 10 |
4,702 |
int a[25];
int f(int x)
{
int t=1,max=1;
if(a[x+1]==0)
max=1;
else
{
for(int i=x+1;a[i]!=0;i++)
if(a[x]>=a[i])
{
t=f(i)+1;
if(t>max) max=t;
}
}
return max;
}
main()
{
int n,t,max,i,M;
scanf("%d",&n);
memset(a,0,25*sizeof(int));
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
M=f(n-1);
for(i=n-2;i>=0;i--)
{
f(i);
if(M<f(i))
M=f(i);
}
printf("%d",M);
getchar();
getchar();
}
| 10 |
4,703 | int bomb[25],p=0,k,antibomb[25],j=0,answer[2]={0,0};
void makeanti(int a[]);
void main()
{
int i;
scanf("%d",&k);
for(i=0;i<k;i++) scanf("%d",&bomb[i]);
makeanti(bomb);
printf("%d",answer[0]);
getchar();
getchar();
}
void makeanti(int bomb[])
{
int i,l,r=0,aa;
if(k==0)
{
answer[1]=j;
answer[0]=answer[0]>answer[1]?answer[0]:answer[1];
}
else
for(i=0;i<k;i++)
{
if(j==0) antibomb[j++]=bomb[i];
else if(bomb[i]<=antibomb[j-1])
{
antibomb[j++]=bomb[i];
r=1;
}
else if(r==0&&i==k-1)
{
answer[1]=j;
answer[0]=answer[0]>answer[1]?answer[0]:answer[1];
continue;
}
else continue;
k-=(i+1);
for(l=0;l<=i;l++) bomb++;
makeanti(bomb);
j--;
k+=(i+1);
for(l=0;l<=i;l++) bomb--;
}
}
| 10 |
4,704 | int f[26]={0};
int b[26]={0};
int main()
{
int n,k,i,j,tmax,ti;
cin>>n;
for(i=0;i<n;i++)
cin>>b[i];
f[0]=1;
for(i=1;i<n;i++)
{
tmax=1;
for(j=i-1;j>=0;j--)
{
if(b[j]>=b[i]&&f[j]+1>=tmax)
{
tmax=f[j]+1;
}
}
f[i]=tmax;
}
tmax=-1;
for(i=0;i<n;i++)
{
// cout<<f[i]<<endl;
if(f[i]>tmax)
tmax=f[i];
}
cout<<tmax<<endl;
return 0;
}
| 10 |
4,705 | const int maxn=30;
int h[maxn];
int f[maxn];
int main()
{
int n;
// freopen("readin","r",stdin);
scanf("%d",&n);
int i;
for(i=1;i<=n;i++)scanf("%d",h+i);
f[1]=1;
int j;
int max=0;
for(i=2;i<=n;i++)
{max=0;
for(j=1;j<=i-1;j++)if(h[i]<=h[j])
{
if(max<f[j])
max=f[j];
}
f[i]=max+1;
}
max=0;
for(i=1;i<=n;i++)if(max<f[i])
max=f[i];
printf("%d\n",max);
return 0;
} | 10 |
4,706 | void main()
{
int n,i,j,m=0;
int a[25],b[25]={1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1};
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%d",&a[i]);
b[n-1]=1;
for(i=n-2;i>=0;i--)
{
for(j=i+1;j<n;j++)
{
if((a[i]>=a[j])&&(b[i]<=b[j])) b[i]=b[j]+1;
}
}
for(i=0;i<n;i++)
{
if(b[i]>=m) m=b[i];
}
printf("%d\n",m);
} | 10 |
4,707 |
int maxnum(int*a,int n,int up){
if(n==0)return 0;
int i,max=-1,t;
for(i=0;i<n;i++){
t=up;
if(a[i]<=up||up==-1)t=a[i];
else continue;
if(maxnum(a+i+1,n-1-i,t)>max)max=maxnum(a+i+1,n-i-1,t);
}
return max+1;
}
int main(){
int i,n,a[25];
cin>>n;
for(i=0;i<n;i++)cin>>a[i];
cout<<maxnum(a,n,-1);
}
| 10 |
4,708 | int main()
{
int i,j,k,n,p,m,c,a[50],b[50];
scanf("%d",&n);
p=0;
for (i=0;i<n;i++) scanf("%d",&a[i]);
for (i=0;i<n;i++) b[i]=1;
for (i=1;i<n;i++)
{
for (j=0;j<i;j++)
if (a[i]<=a[j])
if (b[i]<b[j]+1) b[i]=b[j]+1;
}
for (i=0;i<n;i++)
if (p<b[i]) p=b[i];
printf("%d",p);
}
| 10 |
4,709 | int main()
{
int n,c,i,j;
int a[100],b[100];
char ch;
scanf("%d",&n);
ch=getchar();
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
b[i]=0;
ch=getchar();
}
for(i=n-1;i>=0;i--)
{
b[i]=0;
for(j=i;j<=n-1;j++)
{
if(b[j]>b[i]&&a[j]<=a[i])b[i]=b[j];
}
b[i]=b[i]+1;
}
c=0;
for(i=0;i<=n-1;i++)
{
if(b[i]>c)c=b[i];
}
printf("%d",c);
return(0);
}
| 10 |
4,710 | int main()
{
int a[25],k,b[25];
cin>>k;
int max1;
// int dex;
for(int i=0;i<k;i++)
{
cin>>a[i];
b[i]=1;
}
for(int j=k-1;j>=0;j--)
{
max1=0;
for(int m=k-1;m>j;m--)
{
if(a[m]<=a[j]&&b[m]>=max1)
max1=b[m];
}
b[j]=max1+1;
}
int max;
max=b[0];
for(int n=1;n<k;n++)
{
if(max<b[n])
max=b[n];
}
cout<<max<<endl;
return 0;
}
| 10 |
4,711 |
int k;
int arr[30];
int num[30];
int main()
{
cin>>k;
for(int i=0;i<k;i++)
cin>>arr[i];
for(int i=0;i<k;i++)
num[i]=1;
for(int i=0;i<k;i++)
{
for(int j=0;j<i;j++)
{
if(arr[j]>=arr[i]&&num[j]>=num[i])
num[i]=num[j]+1;
}
}
int res=-1;
for(int i=0;i<k;i++)
if(num[i]>res)
res=num[i];
cout<<res<<endl;
return 0;
}
| 10 |
4,712 | int dd(int no,float h);
int n,a[25];
int main()
{
int i;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
cout<<dd(1,10000)<<endl;
return 0;
}
int dd(int no,float h)
{
while(h<a[no-1])
{ if(no==n)
break;
no++;
}
if(no==n)
{
if(h>=a[n-1])
{return 1;}
else
{return 0;}
}
else
{
int b=dd(no+1,a[no-1]);int c=dd(no+1,h);
if (b>=c)
{ return b+1;}
else
{ return c;}
}
} | 10 |
4,713 | int count[30],hgt[30],n,i,j,max,temp;
void m(int s,int t);
void main()
{
for(i=1;i<=25;i++){
count[i]=0;
}
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&hgt[i]);
count[1]=1;
}
for(i=2;i<=n;i++){
temp=0;
for(j=1;j<i;j++){
if(hgt[i]<=hgt[j]){
if(temp<count[j]){
temp=count[j];
}
}
}
count[i]=temp+1;
}
max=0;
for(i=1;i<=n;i++){
if(max<count[i]){
max=count[i];
}
}
printf("%d\n",max);
} | 10 |
4,714 | int max(int t1[],int t2[],int m,int n,int d)
{
int i,y=0;
for(i=m+1;i<n;i++)
{
if(t1[i]<=d&&t2[i]>y)
y=t2[i];
}
return y;
}
main()
{
int a[10000],b[10000]={0},i,j,n,t,x=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
b[n-1]=1;
for(i=n-2;i>=0;i--)
{
b[i]=max(a,b,i,n,a[i])+1;
}
for(i=0;i<n-1;i++)
{
if(b[i]>x)
x=b[i];
}
printf("%d",x);
}
| 10 |
4,715 | /*
* lee2.cpp
*
* Created on: 2011-6-8
* Author: 09143
*/
int kMis;
int Mis[30];
int Array[30];
void Lanjie(int iM)
{
for(int i = iM; i < kMis; i ++)
{
if(Mis[iM - 1] >= Mis[i] && Array[iM - 1] <= Array[i])
Array[iM - 1] = Array[i] + 1;
}
if(iM > 1) Lanjie(iM - 1);
return;
}
int main()
{
cin >> kMis;
for(int i = 0; i < kMis; i ++)
cin >> Mis[i];
for(int i = 0; i < kMis; i ++)
{
Array[i] = 1;
}
Lanjie(kMis);
int MaxLen = -1;
for(int i = 0; i < kMis; i ++)
if(MaxLen < Array[i]) MaxLen = Array[i];
cout << MaxLen << endl;
}
| 10 |
4,716 | int a[25]={0},n;
int main ()
{ int F (int x);
int i,z=0;
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d",&a[i]);
for (i=0;i<n;i++)
if (z<F(i)) z=F(i);
printf("%d\n",z);
}
int F (int x)
{
int i,z=1;
for (i=x+1;i<n;i++)
if ((a[x]>=a[i])&&(F(i)+1>z))
z=F(i)+1;
return z;}
| 10 |
4,717 | int main()
{
int k,i,j,p,h[100]={0},m[100],max=1;
scanf("%d",&k);
for(i=0;i<k;i++)
{
scanf("%d",&h[i]);
}
for(i=0;i<100;i++)
{
m[i]=1;
}
for(i=k-2;i>=0;i--)
{
for(j=i+1;j<k;j++)
{
if((h[j]<=h[i])&&(m[j]+1>=m[i]))
{
m[i]=m[j]+1;
}
}
}
for(p=k-1;p>=0;p--)
{
if(m[p]>=max)
{max=m[p];}
}
printf("%d",max);
return 0;
}
| 10 |
4,718 | //????????????......by ??? 2011.11.10
//??????????? ????
int a[max],k;
int find(int p) //???p?????????
{
int i,temp=0,t;
if (p==k-1) return 1;
for (i=p+1;i<=k-1;i++)
{
if (a[p]>=a[i])
{
t=find(i);
if (temp<t) temp=t;
}
}
return temp+1;
}
main()
{
int i,j,p=0,t,ans=0;
scanf("%d",&k);
for (i=0;i<=k-1;i++)
scanf("%d",&a[i]);
for (i=0;i<=k-1;i++)
{
t=find(i);
if (ans<t) ans=t;
}
printf("%d",ans);
} | 10 |
4,719 |
int main()
{
int n,i,a[1000],*p,min=31999;
cin>>n;
for(i=0;i<n;i++) cin>>a[i];
p=a;
int daodan(int i,int min,int *p,int n);
cout<<daodan(0,min,p,n);
return 0;
}
int max(int a,int b)
{
if(a>b) return a;
else return b;
}
int daodan(int i,int min,int *p,int n)
{
if(i==n) return 0;
if(*(p+i)<=min) return max(daodan(i+1,*(p+i),p,n)+1,daodan(i+1,min,p,n));
else return daodan(i+1,min,p,n);
}
| 10 |
4,720 |
void make(int a[], int n);
int main()
{
int n = 0;
int hight[26];
int i = 0;
cin >> n;
for (i = 1; i <= n ; i++)
cin >> hight[i];
make(hight, n);
return 0;
}
void make(int hight[], int n)
{
int i = 0;
int j = 0;
int a[26];
int max = 0;
a[1] = 1;
for (i = 2; i <= n; i++)
{
a[i] = 1;
for (j = 1; j < i; j++)
if ((hight[j] >= hight[i]) && (a[j] + 1 > a[i]))
a[i] = a[j] + 1;
}
for (i = 1; i <= n; i++)
max = (max > a[i] ? max : a[i]);
cout << max;
}
| 10 |
4,721 | main()
{
int k,i,j;
scanf("%d",&k);
int h[k],n[k];
for(i=0;i<k;i++)
scanf("%d",&h[i]);
for(i=k-1;i>=0;i--)
{
int max=0;
for(j=i+1;j<k;j++)
if(h[j]<=h[i]&&n[j]>max) max=n[j];
n[i]=max+1;
}
int Max=0;
for(i=0;i<k;i++)
if(n[i]>Max) Max=n[i];
printf("%d\n",Max);
} | 10 |
4,722 | int main()
{
int f[26] , maxnum=1 , i , j , h[26] , n ;
cin>>n;
for( i=1 ; i<=n ; i++ ) { cin>>h[i] ; f[i]=1; }
for( i=2 ; i<=n ; i++ )
{
for( j=1 ; j<i ; j++ ) if( h[j]>=h[i] ) f[i]=max( f[i] , f[j]+1 );
maxnum=max( maxnum , f[i] );
}
cout<<maxnum;
}
| 10 |
4,723 |
int a[25],num;
int b[25];
int i,j,k;
int main(){
cin>>num;
for(i=0;i<num;i++){
cin>>a[i];
b[i]=1;
}
int max =0;
b[0]=1;
for(i=1;i<num;i++){
for(j=i-1;j>=0;j--){
if(a[j]>=a[i]){
k = b[j]+1;
if(k>b[i]){
b[i] = k;
if(k>max){
max =k;
}
}
}
}
}
cout<<max<<endl;
return 0;
}
| 10 |
4,724 | int*p;
int n;
int max(int t,int k)
{
if(t>k) return t;
else return k;
}
int pd(int i,int h)
{ if(i==n) return 0;
if(p[i]>h) return pd(i+1,h);
if(p[i]==h) return pd(i+1,h)+1;
return max(pd(i+1,p[i])+1,pd(i+1,h));
}
int main()
{
int i,j,k;
scanf("%d",&n);
p=(int*)malloc(n*sizeof(int));
for(i=0;i<n;i++)
scanf("%d",&p[i]);
k=pd(0,800000);
printf("%d",k);
free(p);
}
| 10 |
4,725 |
void main()
{
int n,i,j,max=1;
int a[25];
int b[25];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
b[i]=1;
}
for(i=1;i<n;i++)
for(j=0;j<i;j++)
{
if(a[i]<=a[j]&&b[i]<b[j]+1)
{
b[i]=b[j]+1;
if(b[i]>max)
max=b[i];
}
}
printf("%d\n",max);
} | 10 |
4,726 | int m,sum,maxim,t,bo[25]={0};
int meishu(int n,int a[])
{ int j;
if(n==m-1)return sum;
else
{ for(j=n+1;j<m;j++)
if(a[n]>=a[j])
{ bo[j]=1;
sum++;
t=meishu(j,a);
if(maxim<t)maxim=t;
sum--;
}
if(j==m&&sum!=1)return sum;
else if(sum==1) return maxim;
}
}
main()
{
int i,a[25],maxi=0;
scanf("%d",&m);
for(i=0;i<m;i++)
scanf("%d",&a[i]);
for(i=0;i<m;i++)
if(bo[i]==0)
{ sum=1;
maxim=1;
if(maxi<meishu(i,a))
maxi=meishu(i,a);
}
printf("%d",maxi);
return 0;
}
| 10 |
4,727 | main()
{
int k,i,max=0,u,j,a[26]={0},b[26]={1};
scanf("%d",&k);
for(i=1;i<=k;i++)
scanf("%d",&a[i]);
for(i=1;i<=k;i++)
b[i]=1;
for(i=k-1;i>=1;i--)
for(j=i+1;j<=k;j++)
{
if(a[j]<=a[i]&&b[i]<b[j]+1)
b[i]=b[j]+1;
u=b[i];
}
for(i=1;i<=k;i++)
max=(max>=b[i])?max:b[i];
printf("%d",max);
}
| 10 |
4,728 | int maxii(int n,int *a)
{
int k,i,s;
k=1;
for(i=1;i<n;i++)
{
if ((a[i]<=a[0])&&(maxii(n-i,a+i)>(k-1)))
k=maxii(n-i,a+i)+1;
}
return k;
}
main()
{
int n,*k,i,j,c;
int a[25];
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d",&a[i]);
k=(int*)malloc(n*sizeof(int));
c=1;
for(j=0;j<n;j++)
{
if (c<maxii(n-j,a+j))
c=maxii(n-j,a+j);
}
printf("%d",c);
} | 10 |
4,729 | int n,a[99];
void main()
{
int f(int,int,int);
int i,max;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
max=f(99999,0,0);
printf("%d\n",max);
}
int f(int hi,int num,int i)
{
int t1,t2;
while(a[i]>hi)
i++;
if(i>=n)
return num;
t1=f(hi,num,i+1);
t2=f(a[i],num+1,i+1);
return t1>t2?t1:t2;
}
| 10 |
4,730 |
int main()
{int m,n,k,i,j,a[25],b[25],max;
scanf("%d",&k);
for(i=0;i<=k-1;i++)
scanf("%d",&a[i]);
for(i=k-1;i>=0;i--)
{
if(i==k-1)
b[i]=1;
else
{max=0;
for(j=i+1;j<=k-1;j++)
if(a[j]<=a[i]&&b[j]>=max)
max=b[j];
b[i]=max+1;
}
}
max=0;
for(i=0;i<=k-1;i++)
{if(b[i]>=max)
max=b[i];}
printf("%d",max);
return 0;
}
| 10 |
4,731 | int main()
{
int s[26],d[26];
int i,j,k;
int n;
scanf("%d", &n);
for (i=0;i<n;i++)
{
scanf("%d", s+i);
d[i]=0;
}
for (i=n-1;i>-1;i--)
{
k=0;
for (j=i+1;j<n;j++)
{
if ( k<d[j] && s[i]>=s[j]) k=d[j];
}
k++;
d[i]=k;
}
k=0;
for (i=0;i<n;i++)
{
if ( d[i]>k) k=d[i];}
printf("%d", k);
return 0;
}
| 10 |
4,732 | int dp[100];
int main(void)
{
int i,j,k;
int *h;
int max;
scanf("%d",&k);
h=(int *)malloc((k+1)*sizeof(int));
for(i=1;i<=k;i++)
{
scanf("%d",&h[i]);
}
dp[k]=0;
for(i=k-1;i>=0;i--)
{
max=0;
for(j=i+1;j<=k;j++)
{
if(h[i]>=h[j])
{
if(dp[j]+1>max)
max=dp[j]+1;
}
}
dp[i]=max;
}
int m=0;
for(i=0;i<=k;i++)
{
if(dp[i]>m)
m=dp[i];
}
printf("%d",m+1);
return 0;
} | 10 |
4,733 | int N;
int a[26]={2100000000};
void main()
{
int f(int x);
int i;
scanf("%d",&N);
for(i=1;i<=N;i++)
scanf("%d",&a[i]);
printf("%d",f(0)-1);
}
int f(int x)
{
int i;
int p;
int y=0;
for(i=x+1;i<=N;i++)
{
if(a[i]<=a[x])
{
p=f(i);
y=(y>=p?y:p);
}
}
return (y+1);
}
| 10 |
4,734 | int main()
{
int j,k,i,max=0;
scanf("%d",&k);
int *p=(int *)malloc(k*sizeof(int));
int *q=(int *)malloc(k*sizeof(int));
scanf("%d",&p[0]);
for(i=1;i<k;i++)
scanf(" %d",&p[i]);
for(i=0;i<k;i++)
q[i]=1;
for(i=k-2;i>=0;i--)
for(j=i+1;j<k;j++)
if(p[i]>=p[j]&&q[j]>=q[i])
q[i]=q[j]+1;
for(i=0;i<k;i++)
if(q[i]>max)
max=q[i];
printf("%d",max);
} | 10 |
4,735 | int a[36],f[36];
int max(int a,int b)
{
if(a>b)return a;else return b;
}
int main()
{
int k,i,j;
int ans=0;
scanf("%d",&k);
for(i=1;i<=k;i++)scanf("%d",&a[i]);
f[0]=0;
for(i=1;i<=k;i++)
{
f[i]=1;
for(j=1;j<i;j++)
if(a[i]<=a[j])
f[i]=max(f[i],f[j]+1);
ans=max(ans,f[i]);
}
cout<<ans<<endl;
return 0;
} | 10 |
4,736 | int aMaxLen[35];
int nTmp;
int main()
{
int k,i;
cin>>k;
int b[25];
for(i=0;i<k;i++)
cin>>b[i];
aMaxLen[1]=1;
for(i=2;i<=k;i++)
{
int nTmp=0;
for(int j=1;j<i;j++)
{
if(b[i]<b[j])
{
if(nTmp<aMaxLen[j])
nTmp=aMaxLen[j];
}
}
aMaxLen[i]=nTmp+1;
}
int nMax=-1;
for(i=1;i<=k;i++)
if(nMax<aMaxLen[i])
nMax=aMaxLen[i];
cout<<nMax<<endl;
return 0;
} | 10 |
4,737 |
main()
{
int k=0,max=0;
scanf("%d",&k);
int *h=(int *)malloc(k*sizeof(int));
int *p=(int *)malloc(k*sizeof(int));
for(int i=0;i<k;i++)
scanf("%d",&h[i]);
p[k-1]=1;
for(int i=0;i<k-1;i++)
{
for(int j=1;k-2-i+j<=k-1;j++)
{
if(h[k-2-i]>=h[k-2-i+j])
{
if(max<=p[k-2-i+j])
max=p[k-2-i+j];
}
}
p[k-2-i]=max+1;
max=0;
}
max=p[0];
for(int i=0;i<k;i++)
if(max<p[i])
max=p[i];
printf("%d",max);
free(h);
free(p);
} | 10 |
4,738 | int a[25],b[25]={1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1};
int n;
int changdu(int i)
{
int j,max=1;
if(b[i]!=1)
return b[i];
else
{
for(j=i+1;j<n;j++)
{
if(a[i]>=a[j])
{
b[i]=changdu(j)+1;
if(b[i]>max)
max=b[i];
}
}
b[i]=max;
return max;
}
}
main()
{
int max=0,i;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
b[i]=changdu(i);
for(i=0;i<n;i++)
{
if(b[i]>max)
max=b[i];
}
printf("%d",max);
}
| 10 |
4,739 | int analyse(int *,int *,int,int);
int main()
{
int k;
int height[25],numbers[25]={0};
int i,max,temp;
scanf("%d",&k);
for(i=0;i<k;i++)
scanf("%d",height+i);
max=numbers[24]=1;
for(i=23;i>=0;i--)
{
temp=analyse(height,numbers,i,k);
if(temp>max) max=temp;
}
printf("%d\n",max);
return 0;
}
int analyse(int *height,int *numbers,int seq,int k)
{
int max=0,temp,i;
for(i=k-1;i>seq;i--)
{
if(height[seq]>=height[i])
{
temp=numbers[i];
if(temp>max) max=temp;
}
}
max++;
numbers[seq]=max;
return max;
}
| 10 |
4,740 | void main()
{
int n,a[25],b[25];
int i,j;
b[0]=1;
scanf("%d",&n);
for(i=1;i<n;i++)
{
b[i]=0;
}
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=1;i<n;i++)
{b[i]=b[0]+1;
for(j=0;j<i;j++)
{
if(a[j]>=a[i])
{
if(b[j]+1>b[i])
{
b[i]=b[j]+1;
}
}
}
}
if(n==8||n==3||a[n-1]==1333)
printf("%d",b[n-1]);
else
{
printf("%d",b[n-1]-1);
}
} | 10 |
4,741 | int main()
{
int N;
int a[30]={0},f[30]={0};
cin >> N;
for (int i=0; i< N ; i++)
{
cin >> a[i];
f[i]=1;
}
int ans = 0;
for (int i=1; i<N;i++)
{
int mx=0;
for (int j=0;j<i;j++)
if (a[j]>=a[i] && f[j]>mx)
mx = f[j];
f[i]= mx+1;
if (ans < f[i]) ans = f[i];
}
cout << ans << endl;
return 0;
} | 10 |
4,742 | void main()
{
int i,j,rec[25],n[25],m,k;
scanf("%d",&k);
for(i=0;i<=k-1;i++)
{
scanf("%d",&rec[i]);
n[i]=1;
}
for(i=1;i<=k-1;i++)
for(j=0;j<i;j++)
if(rec[j]>=rec[i])
n[i]=n[i]>(n[j]+1)?n[i]:n[j]+1;
m=0;
for(i=0;i<k;i++)
m=m>n[i]?m:n[i];
printf("%d\n",m);
}
| 10 |
4,743 |
int left(int *h,int i);
void main()
{
int n,i,h[MAX],num,max;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",h+i);
for(i=n-1;i>=0;i--){
num=left(h,i);
if(i==n-1)
max=num;
else if(num>max)
max=num;
}
printf("%d\n",max);
}
int left(int *h,int i)
{
int j,flag=0,num,max;
if(i==0)
return 1;
else{
for(j=i-1;j>=0;j--){
if(*(h+j)>=*(h+i)){
num=left(h,j)+1;
if(flag==0){
max=num;
flag=1;
}
else if(num>max)
max=num;
}
}
if(flag==0)
return 1;
else
return max;
}
}
| 10 |
4,744 |
int n , a[30] , f[30] , ans;
int main()
{
scanf("%d" , &n);
for (int i = 1; i <= n; ++i)
scanf("%d" , &a[i]);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= i; ++j)
if (a[j] >= a[i] && f[j] > f[i]) f[i] = f[j];
f[i]++;
}
ans = 0;
for (int i = 1; i <= n; ++i)
if (f[i] > ans) ans = f[i];
printf("%d\n" , ans);
}
| 10 |
4,745 |
int main()
{
int n,i,j;
int k[25], a[25];
int maxk, maxa;
scanf("%d",&n);
for(i = 0; i<n;i++)
{
scanf("%d",&k[i]);
}
a[0] = 1;
maxk = 1;
for(i =1;i<n;i++)
{
maxa = 0;
for(j=0;j<i;j++)
{
if(k[j]>=k[i])
{
if(a[j]>=maxa)
{
maxa = a[j];
}
}
}
a[i] = maxa + 1;
if(a[i]>= maxk)
{
maxk = a[i];
}
}
printf("%d",maxk);
}
| 10 |
4,746 |
int main()
{
int i, j, n, num[100], mark[100] = {0}, max;
cin >> n;
for (i = 0; i < n; i ++)
{
cin >> num[i];
}
mark[n - 1] = 1;
for (i = n - 2; i >= 0; i --)
{
max = 0;
for (j = i + 1; j < n; j ++)
{
if (num[j] <= num[i] && mark[j] > max)
{
max = mark[j];
}
}
mark[i] = max + 1;
}
max = 0;
for (i = 0; i < n; i ++)
{
if (mark[i] > max)
{
max = mark[i];
}
}
cout << max << endl;
return 0;
} | 10 |
4,747 | int k, i, j, an[30];
int DFS (int h, int n)
{
int t1, t2;
if (n == k - 1)
{
if (an[n] > h)
return 0;
else
return 1;
}
if (an[n] > h)
return DFS (h, n + 1);
else
{
t1 = DFS (h, n + 1);
t2 = DFS (an[n], n + 1) + 1;
if (t1 > t2)
return t1;
else
return t2;
}
}
int main ()
{
cin >> k;
for (i = 0; i < k ;i ++)
{
cin >> an[i];
}
cout << DFS(INT_MAX, 0) << endl;
return 0;
} | 10 |
4,748 | void main()
{int a[100],b[100],i,j,k=0,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d",&a[i]);
b[i]=1;}
for(i=n-1;i>=0;i--)
{k=0;
for(j=n-1;j>i;j--)
{if(a[i]>=a[j]&&b[j]>k)
{k=b[j];
b[i]=b[j]+1;}
}
}
k=b[0];
for(i=0;i<n;i++)
{if(b[i]>k)
k=b[i];}
printf("%d",k);
} | 10 |
4,749 | int main()
{
int lj(int a[],int n,int m);
int n,m,i,j,l,k=0,s,t=0,a[25],b[25];
scanf("%d",&k);
for(i=0;i<k;i++)
scanf("%d",&a[i]);
for(i=0;i<k;i++)
b[i]=lj(a,i,k);
for(i=0;i<k;i++)
{
if(t<b[i])
t=b[i];
}
printf("%d",t);
getchar();
getchar();
getchar();
}
int lj(int a[],int n,int m)//n????m???
{
int i,t,p,l=0,b[25];
if(n==m-1)
return 1;
else
{
for(i=0;i<25;i++)
b[i]=0;
for(i=n+1;i<m;i++)
{
if(a[i]<=a[n])
{
b[i]=lj(a,i,m);
}
}
t=b[n+1];
for(i=n+1;i<m;i++)
{
if(t<b[i])
t=b[i];
}
return t+1;
}
}
| 10 |
4,750 | main()
{int k,i,j,s,d,max=0,m=1;
int a[26],b[26];
scanf("%d",&k);
for(i=1;i<=k;i++)
scanf("%d",&a[i]);
b[k]=1;
for(i=k-1;i>0;i--)
{
for(j=i+1;j<=k;j++)
{
if(a[i]>=a[j]&&b[j]>max)
max=b[j];
}
b[i]=max+1;
max=0;
}
for(d=1;d<=k;d++)
{
if(b[d]>=m) m=b[d];
}
printf("%d",m);
}
| 10 |
4,751 | int f(int s[],int n);
void main()
{
int k,a[25],i,N;
scanf("%d",&k);
for(i=0;i<k;i++)
scanf("%d",&a[i]);
N=f(a,k);
printf("%d",N);
}
int f(int s[],int n)
{
int i,b[25],j;
int flag=0,flag2=0;
int *p=s;
for(i=0;i<n-1;i++)
if(s[i]<s[i+1]) {flag=1;break;}
if(flag==0) return n;
else
{for(i=1;i<n;i++)
{if(s[i]>s[0]){flag2=1;break;}}
if(flag2==0) return f(p+1,n-1)+1;
else
{
b[0]=s[0];
for(i=1,j=1;i<n;i++)
if(s[i]<=s[0]) {b[j]=s[i];j++;}
return ((f(p+1,n-1))>f(b,j)?(f(p+1,n-1)):f(b,j));
} }
}
| 10 |
4,752 |
// ???len[i]??a[i]??????????
// ??????: len[i] = max{h[j]},0 <= j < i,
// h[j] = len[j]+1, ??a[i] > a[j]
// h[j] = 1, ??a[i] <= a[j]
int main()
{
int a[M], len[M], n, i, j, max, longest;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
longest = 1;
for (i = 0; i < n; i++)
{
max = 1;
len[i] = 1;
for (j = 0; j < i; j++)
{
if (a[i] <= a[j])
max = len[j] + 1;
if (len[i] < max)
len[i] = max;
}
if (len[i] > longest)
longest = len[i];
}
printf("%d\n", longest);
return 0;
}
| 10 |
4,753 | /*************
* ???????
* ???2010.10.12
* ?????1000012923
**************/
int calc(int*,int,int);
int main(){
int k,h[25],i=0;
cin>>k;
while(cin>>h[i]){
i++;
if(i==k)break;
}
cout<<calc(h,k,(1<<31-1));
}
int calc(int* h,int k,int limit){
int i,ret=0,t=0;
for(i=0;i<k;i++){
if(h[i]>limit)continue;
t=1+calc(h+i+1,k-i-1,h[i]);
if(t>ret)ret=t;
}
return ret;
}
| 10 |
4,754 |
int num[30];
int dst[30];
int main()
{
memset(dst, 0, sizeof(dst));
int n;
int ans;
cin>>n;
for(int i = 0; i < n ; i++)
{
cin>>num[i];
}
dst[0] = 1;
int temp, max;
for(int i = 1; i < n; i++)
{
max = 1;
for(int j = 0; j < i; j++)
{
if(num[i] <= num[j] )
{
temp = dst[j] + 1;
if(max < temp)
max = temp;
}
}
dst[i] = max;
}
max = 0;
for(int i= 0; i < n; i++)
{
//cout<<dst[i]<<" ";
if(max < dst[i])
max = dst[i];
}
cout<<max;
return 0;
}
| 10 |
4,755 | int main() {
int b[26],k,h[26],t,i,j; //h[26]??????
scanf("%d",&k);
for(i=1;i<=k;i++)
scanf("%d",&h[i]);
for(i=1;i<=k;i++) {
for(j=1,t=0;j<i;j++)
if(h[j]>=h[i])
if(b[j]>t) t=b[j];
if(t==0) b[i]=1;
else b[i]=t+1;
}
for(i=1,t=0;i<=k;i++)
if(b[i]>t) t=b[i];
printf("%d",t);
return 0;
} | 10 |
4,756 | int changdu(int i,int n,int *a,int *b)
{
int j,max=1;
for(j=i+1;j<n;j++)
{
if(a[i]>=a[j])
{
b[i]=changdu(j,n,a,b)+1;
if(b[i]>max)
max=b[i];
}
}
b[i]=max;
return max;
}
main()
{
int a[25],b[25];
int n;
int max=0,i;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
b[i]=changdu(i,n,a,b);
for(i=0;i<n;i++)
{
if(b[i]>max)
max=b[i];
}
printf("%d",max);
}
| 10 |
4,757 | int main()
{
int n;
scanf("%d",&n);
int a[n],b[n];
int i,j;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
b[i]=1;
}
int m=0;
for(i=0;i<n;i++)
{
for(j=0;j<i;j++)
{
if((a[j]>=a[i])&&(b[j]>=b[i]))
b[i]=b[j]+1;
}
if(b[i]>m)m=b[i];
}
printf("%d",m);
} | 10 |
4,758 | int a[30];
int len[30];
int main()
{
int n;
cin>>n;
int i,j;
for(i=1;i<=n;i++)
{
cin>>a[n-i+1];
len[i] = 1;
}
for(i=2;i<=n;i++)
for(j=1;j<i;j++)
{
if(a[j]<=a[i]&&(len[j]+1>len[i]))
len[i] = len[j] + 1;
}
int maxx=0;
for(i=1;i<=n;i++)
{
if(len[i]>maxx)
maxx= len[i];
}
cout<<maxx<<endl;
return 0;
} | 10 |
4,759 |
int max(int* data,int lens)
{
int r=*data;
for(int j=0;j<lens;j++)if(*(data+j)>r)r=*(data+j);
return r;
}
int f(int* data,int lens,int height)
{
int tempResult[25];
if(lens==0)return 0;
int count=0,tempHeight=0;
for(int i=0;i<lens;i++)
{
if(data[i]<=height && data[i]>=tempHeight)
{tempHeight=data[i];tempResult[count]=f(data+i+1,lens-i-1,data[i]);count++;}
}
if(count==0)return 0;
return max(tempResult,count)+1;
}
int main()
{
int data[25];
int n;
cin>>n;
for(int i=0;i<n;i++)cin>>data[i];
cout<<f(data,n,max(data,n));
return 0;
}
| 10 |
4,760 | int data[K];
int ju[K][K];
int weight[K];
int main(int argc, char *argv[])
{
int n = 0;
int i = 0;
int j = 0;
int max = 0;
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
scanf("%d", &n);
memset(ju, 0, sizeof(ju));
for(i = 0; i< n; i++)
{
scanf("%d", &data[i]);
weight[i] = 1;
}
for(i=0; i<n-1; i++)
{
for(j=i+1; j<n;j++)
{
if(data[i] >= data[j])
{
ju[i][j] = 1;
}
}
}
for(i=n-2; i>=0; i--)
{
for(j=i+1; j<n; j++)
{
if(ju[i][j])
{
if(weight[i] < weight[j] + 1)
{
weight[i] = weight[j]+1;
}
}
}
}
max =0 ;
for(i=0; i<n;i++)
{
if(max < weight[i])
max =weight[i];
}
printf("%d\n", max);
return 0;
} | 10 |
4,761 | int k;
int num[26];
int val[26];
int main()
{
cin>>k;
for(int i=0;i<k;i++)
{
cin>>num[i];
val[i]=0;
}
//for(int i=0;i<k;i++)
// cout<<num[i]<<endl;
for(int i=k-1;i>=0;i--)
{
if(i==k-1)
val[i]=1;
else
{
int temp=0;
for(int j=i;j<k;j++)
{
if(num[i]>=num[j]&&val[j]>=temp)
{
temp=val[j];
// cout<<num[i]<<" "<<num[j]<<" "<<temp<<endl;
}
}
val[i]=temp+1;
}
}
int sum=0;
for(int i=0;i<k;i++)
{
//cout<<val[i]<<endl;
if(val[i]>=sum)
sum=val[i];
}
cout<<sum<<endl;
return 0;
} | 10 |
4,762 | int max(int s[],int n)
{
int i,d=0;
for(i=0;i<n;i++)
{
if(s[i]>d)
d=s[i];
}
return d;
}
void bl(int h[],int s[],int m)
{
int i,j;
for(i=0;i<m;i++)
{
if(i==0)
s[i]=1;
else
{
s[i]=1;
for(j=0;j<i;j++)
if(h[j]>=h[i]&&(s[j]+1)>s[i])
{
s[i]=s[j]+1;
}
}
}
}
void main()
{
int r,i,n;
scanf("%d",&n);
int h[26],d[26]={0};
for(i=0;i<n;i++)
scanf("%d",&h[i]);
bl(h,d,n);
r=max(d,n);
printf("%d",r);
}
| 10 |
4,763 | int h[25],n;
int hack(int i,int w){
if(i==n-1){
if(h[i]<=w) return 1;
else return 0;
}
int b=hack(i+1,w),c=0;
if(h[i]<=w)
c=1+hack(i+1,h[i]);
if(b>c) return b;
else return c;
}
int main(){
scanf("%d",&n);
int i,max=0;
for(i=0;i<n;i++){
scanf("%d",&h[i]);
if(h[i]>max)
max=h[i];
}
printf("%d",hack(0,max));
return 0;
} | 10 |
4,764 | /*
* 1.cpp
*
* Created on: 2011-6-8
* Author: 09119
*/
int k;
int high[30];
int ff(int pos,int highflag,int count)
{
if(pos == k)
return count;
if(high[pos] <= highflag)
{
int tmp1 = ff(pos+1,high[pos],count+1);
int tmp2 = ff(pos+1,highflag,count);
if(tmp1 > tmp2 )
return tmp1;
else
return tmp2;
}
else
{
return ff(pos+1,highflag,count);
}
}
int main()
{
int i;
cin>>k;
for(i=0;i<k;i++)
{
cin>>high[i];
}
int result = ff(0,99999,0);
cout<<result<<endl;
return 0;
}
| 10 |
4,765 | struct daodan
{
int height;
int number;
};
int compare(const void* a,const void* b)
{
struct daodan* x=(struct daodan*)a;
struct daodan* y=(struct daodan*)b;
return (((*y).number)-((*x).number));
}
int nextmax(struct daodan* dao,int k,int n)
{
int *a=(int *)malloc((n-1-k)*sizeof(int));
int count=0,b,c=0;
for(int i=k+1;i<=n-1;i++)
{
if((dao[i]).height<=(dao[k]).height)
{
a[count]=dao[i].number;
count++;
}
/*else if((dao[i].height)==dao[k].height)
{
b=dao[i].number;
c++;
}
*/
}
int max=0;
for(int j=0;j<=count-1;j++)
{
if(a[j]>max)
{
max=a[j];
}
}
/*if(max==b)
{
return max+c;
}
else
{
return max;
}
*/
return max;
}
int main()
{
int n;
scanf("%d",&n);
struct daodan* dao=(struct daodan*)malloc(n*sizeof(struct daodan));
for(int i=0;i<=n-1;i++)
{
scanf("%d",&dao[i].height);
}
for(int j=0;j<=n-1;j++)
{
dao[j].number=1;
}
for(int k=n-2;k>=0;k--)
{
dao[k].number=nextmax(dao,k,n)+1;
}
int max=dao[0].number;
for(int l=1;l<=n-1;l++)
{
if(dao[l].number>max)
{
max=dao[l].number;
}
}
printf("%d",max);
}
| 10 |
4,766 | int max(int sum[25],int x[25],int i,int j,int k)
{
int t,l=1;
static int y[25];
t=i+1;
for(;t<=k-1;t++)
if(t!=j&&x[i]>=x[t])
{y[l]=sum[t];
l++;
}
for(i=1;i<l;i++)
if(sum[j]<y[i])
break;
if(i==l)
return(1);
else
return(0);
}
main()
{
int k,i,j;
static int x[25],sum[25];
scanf("%d",&k);
for(i=0;i<k;i++)
scanf("%d",&x[i]);
sum[k-1]=1;
for(i=k-2;i>=0;i--)
{ for(j=i+1;j<=k-1;j++)
if(x[i]>=x[j]&&max(sum,x,i,j,k))
sum[i]=sum[j];
sum[i]++;
}
int m=sum[0];
for(i=1;i<k;i++)
if(sum[i]>m)
m=sum[i];
printf("%d",m);
}
| 10 |
4,767 | void main()
{
int num,h[27]={100000000},lj[27][27]={0};//lj[ex-turn][turn]
int i,j,k,max;
scanf("%d",&num);
for(i=1;i<=num;i++)
scanf("%d",&h[i]);
for(i=num;i>=0;i--)//exturn
{
for(j=num;j>i;j--)//turn
{
if(h[i]>=h[j])
{
max=0;
for(k=j;k<=num;k++)//???j?
max=(max>lj[i][k])?max:lj[i][k];
for(k=j;k<=num;k++)//???
if(h[j]>=h[k])
max=(max>lj[j][k]+1)?max:lj[j][k]+1;
lj[i][j]=max;
}
}
}
printf("%d\n",lj[0][1]);
} | 10 |
4,768 | const int maxn = 55;
int a[maxn], dp[maxn][maxn];
int main()
{
int T, n, i, j, ans;
while (scanf ("%d", &n)!=EOF)
{
for (i=1; i<=n; i++)scanf ("%d", a+i);
memset (dp, -1, sizeof(dp));
for (i=1; i<=n; i++) dp[i][i] = 1;
for (i=1; i<n; i++)
{
for (j=1; j<=i;j++)
{
dp[i+1][j] = max(dp[i+1][j], dp[i][j]);
if (a[i+1]<=a[j])
dp[i+1][i+1] = max(dp[i+1][i+1], dp[i][j]+1);
}
}
ans = 0;
for (i=n, j=1;j<=i;j++) ans = max(ans, dp[i][j]);
printf ("%d\n", ans);
}
return 0;
}
| 10 |
4,769 | main()
{
int a[25],b[25],c[25],i,j,n,max=0,q;
scanf("%d",&n);
for(i=0;i<n;i++)
{
a[i]=0;
b[i]=0;
}
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=n-1;i>=0;i--)
{
for(j=i;j<n;j++)
{
if(a[i]>=a[j])
{
c[j-i]=b[j]+1;
}
else
{
c[j-i]=1;
}
}
for(j=0;j<n-i;j++)
{
if(c[j]>=b[i])
b[i]=c[j];
}
}
for(i=0;i<n;i++)
{
if(b[i]>=max)
max=b[i];
}
printf("%d",max);
} | 10 |
4,770 |
int a[MAXN], f[MAXN] = {0},n,longest_index=-1,longest_f = -1;
void main()
{
int i,t;
scanf("%d",&n);
for (i=0;i<n;++i)
scanf("%d",&a[i]);
{
int i,j;
for (i=0; i<n;++i)
f[i] = 1;
for (i=n-2; i >= 0; --i)
{
for (j=i+1;j<n;++j)
{
if ((f[i]<f[j]+1 )&& (a[i] >= a[j]))
{
f[i]=f[j]+1;
if (longest_f<f[i])
{
longest_f=f[i];
longest_index=i;
}
}
}
}
}
printf("%d\n",longest_f);
}
| 10 |
4,771 | int main()
{
int a[A],i,j,n,b[A],max=0;
scanf("%d",&n);
for(i=n-1;i>=0;i--)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
b[i]=1;
for(j=i-1;j>=0;j--)
{
if(a[i]>=a[j]&&b[i]<b[j]+1)
{
b[i]=b[j]+1;
}
}
}
for(i=0;i<n;i++)
{
if(max<b[i]) max=b[i];
}
printf("%d",max);
return 0;
}
| 10 |
4,772 |
int p(int n,int heightLimit,int *missileHeight,int missileNum)
{
int a;
int b;
//???????????????
if (n==missileNum-1)
if (missileHeight[n]<=heightLimit)
return 1;
else
return 0;
else
if (missileHeight[n]<=heightLimit)
{
a=1+p(n+1,missileHeight[n],missileHeight,missileNum);
b=p(n+1,heightLimit,missileHeight,missileNum);
return a>b?a:b;
}
else
return p(n+1,heightLimit,missileHeight,missileNum);
}
void main()
{
int n,i,j;
int *missileHeight;
int highest=-1;
scanf("%d",&n);
missileHeight=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d",&(missileHeight[i]));
if (missileHeight[i]>highest) highest=missileHeight[i];
}
printf("%d",p(0,highest,missileHeight,n));
} | 10 |
4,773 |
int result;
void bfs(int a[],int n,int i,int u)
{
int j;
if(result<u)
result=u;
if(i<n)
{
for(j=i+1;j<=n;j++)
{
if(a[j]<=a[i])
bfs(a,n,j,u+1);
}
}
}
int main()
{
int R,C,i,j,n;
int a[26],b[26][26];
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
result=0;
a[0]=99999;
bfs(a,n,0,0);
cout<<result<<endl;
return 0;
} | 10 |
4,774 | main()
{
int n;
scanf("%d",&n);
int a[n];
int i,j,max=0;
for(i=0;i<n;i++)
scanf("%d",&a[i]);
int b[n];
for(i=0;i<n;i++)
b[i]=1;
b[n-1]=1;
for(i=n-2;i>=0;i--)
{
for(j=i+1;j<n;j++)
{
if(a[j]<=a[i]&&b[j]+1>=b[i])
b[i]=b[j]+1;
}
}
for(i=0;i<n;i++)
{
if(b[i]>max)
max=b[i];
}
printf("%d",max);
} | 10 |
4,775 | int main()
{
int k,a[30],b[30],sum,i,j,m,p=0;
scanf("%d",&k);
for(i=0;i<k;i++)
scanf("%d",&a[i]);
b[k-1]=1;
for(i=k-1;i>0;i--)
{
if(a[i-1]>=a[i])b[i-1]=b[i]+1;
else break;
}
for(j=i-1;j>=0;j--)
{
sum=b[k-1];
for(m=k-1;m>j;m--)
{
if(a[j]>=a[m]&&b[m]>=sum)
sum=b[m],p++;
}
if(p==0)b[j]=1;
else
{
b[j]=sum+1;
}
}
sum=0;
for(i=0;i<k;i++)
{
if(b[i]>sum)sum=b[i];
}
printf("%d",sum);
} | 10 |
4,776 | void main()
{
int a[25],b[25],k,i,j,max=0;
scanf("%d",&k);
for(i=0;i<k;i++) {scanf("%d",&a[i]);b[i]=1;}
for(i=1;i<k;i++)
for(j=0;j<i;j++)
if(a[j]>=a[i]) {if(b[j]+1>b[i]) b[i]=b[j]+1;}
for(i=0;i<k;i++)
if (b[i]> max) max=b[i];
printf("%d",max);
} | 10 |
4,777 | /*int fun(int h[],int p[],int x,int y)
{
int f;
if(x*y==0)
f=0;
else
{
if(h[x]==p[y])
f=fun(h,p,x-1,y-1)+1;
else
if(fun(h,p,x-1,y)>fun(h,p,x,y-1))
f=fun(h,p,x-1,y);
else
f=fun(h,p,x,y-1);
}
return(f);
}
*/
void main()
{
int k,h[26],p[26],i,j,m,t,a[26][26];
scanf("%d",&k);
for(i=1;i<=k;i++)
scanf("%d",&h[i]);
for(i=1;i<=k;i++)
p[i]=h[i];
for(i=1;i<k;i++)
{
m=i;
for(j=i+1;j<=k;j++)
if(p[j]>p[m])
m=j;
t=p[i];p[i]=p[m];p[m]=t;
}
/*for(i=1;i<=k;i++) printf("%d ",h[i]);
printf("\n");
for(i=1;i<=k;i++) printf("%d ",p[i]);*/
for(i=0;i<=k;i++)
for(j=0;j<=k;j++)
a[i][j]=0;
/*for(i=0;i<k;i++)
{
for(j=0;j<k;j++)
printf("%d ",a[i][j]);
printf("\n");
}*/
for(i=1;i<=k;i++)
for(j=1;j<=k;j++)
{if(h[i]==p[j])
a[i][j]=a[i-1][j-1]+1;
else {if(a[i-1][j]>a[i][j-1])
a[i][j]=a[i-1][j];
else a[i][j]=a[i][j-1];}}
/*for(i=0;i<=k;i++)
{
printf("\n");
for(j=0;j<=k;j++)
printf("%d ",a[i][j]);
}*/
printf("%d",a[k][k]);
}
| 10 |
4,778 | struct missile
{
int num;
int high;
};
struct missile a[25];
void f(int n,int sum);
int main()
{
int i=0,j=0,sum=0,max=0;
scanf("%d",&sum);
//a=(struct missile*)malloc(sum*sizeof(struct missile));
for(i=0;i<=sum-1;i++) //read in
{
scanf("%d",&a[i].high);
}
for(i=sum-1;i>=0;i--) //find num
{
f(i,sum);
}
for(i=0;i<=sum-1;i++) //find max
{
if(a[i].num>max){max=a[i].num;}
}
printf("%d",max);
}
void f(int n,int sum)
{
int i=0,t=1;//a[n].num???1?
if(n==sum-1)
{a[n].num=1;}
else
{
a[n].num=1;
for(i=n+1;i<=sum-1;i++)
{
if(a[n].high>=a[i].high)
{
if(a[i].num+1>a[n].num)
{a[n].num=a[i].num+1;} //?????? .XXX
}
}
}
}
| 10 |
4,779 | int k,d=0,m;
void f(int i,int a[25],int c[25])
{
if(i==0) a[i]=0;
else a[i]=a[i-1]+1;
for(;;a[i]++)
{if(a[i]==(k-1))
{if(i==0) m=1;
else if(c[a[i]]>c[a[i-1]]) m=i;
else m=i+1;
d=d>m?d:m;
break;}
if(i!=0)
{if(c[a[i]]>c[a[i-1]]) continue;
else f(i+1,a,c);}
else f(1,a,c);
}
}
int main()
{
int i,c[25],a[25];
scanf("%d",&k);
for(i=0;i<k;i++)
scanf("%d",&c[i]);
f(0,a,c);
printf("%d",d);
return 0;
}
| 10 |
4,780 | int a[29],max[29]={0},count[29]={0};
int N;
int select(int x)
{ if(count[x]==0)
{
int i;
for (i=x+1;i<=N;i++)
{if (a[x]>=a[i])
{if(max[x]<=select(i)){max[x] = select(i)+1;}
}
}
if(max[x]==0)
{max[x]=1;}
count[x]=1;
}
/*printf("%d ? ? %d? ",x,max[x]);*/
return max[x];}
main()
{ int maxm;
scanf("%d",&N);
for(int j=1;j<=N;j++)
{scanf("%d",&a[j]);
}
maxm=select(1);
for(int k=2;k<=N;k++)
{if(maxm<select(k))
{maxm=select(k);}
}
/*for(int j=1;j<=N;j++)
{printf("%d ? ? %d? \n",j,select(j));
} */
printf("%d",maxm);
}
| 10 |
4,781 | main()
{
int k,a[25],i,j,l,p,q;
int b[25]={0};
scanf("%d",&k);
for(i=0;i<k;i++)
{
scanf("%d",&a[i]);
}
for(j=k-1;j>=0;j--)
{
for(l=k-1;l>=j;l--)
{
if(l!=j)
{
if((a[j]>=a[l])&&(b[j]==b[l]-1))
{
b[j]=b[l];
}
}
else if(l==j)
{
b[j]=b[j]+1;
}
}
}
for(p=1;p<=k-1;p++)
{
if(b[0]<b[p])
{
q=b[0];
b[0]=b[p];
b[p]=q;
}
}
printf("%d",b[0]);
} | 10 |
4,782 | main()
{
int k,a[26],i;
int check(int a[26],int k);
scanf("%d",&k);
for(i=0;i<k;i++)
scanf("%d",&a[i]);
printf("%d",check(a,k));
}
int check(int a[26],int k)
{
int i,j,m,b[26];
for(i=0;i<k;i++)
{
for(j=0,m=0;j<i;j++)
if(a[j]>=a[i])
if(b[j]>m)
m=b[j];
if(m==0)
b[i]=1;
else
b[i]=m+1;
}
for(i=0,m=0;i<k;i++)
if(b[i]>m)
m=b[i];
return m;
}
| 10 |
4,783 | main()
{
int i,j,n;
scanf("%d",&n);
int high[100],count[100];
for(i=0;i<n;i++)
{
count[i]=0;
scanf("%d",&high[i]);
}
high[n]=0,count[n]=0;
for(i=n-1;i>=0;i--)
{
int step=0;
for(j=i+1;j<=n;j++)
{
if(count[j]>step)
{ if(high[j]<=high[i])
step=count[j];
}
}
count[i]=step+1;
}
int max=0;
for(i=0;i<n;i++)
if(count[i]>max)
max=count[i];
printf("%d",max);
getchar();getchar();getchar(); getchar();getchar();getchar();
}
| 10 |
4,784 | int a[max+10];
int b[max+10];
int maxlen[max+10];
void main()
{
int i,j,n;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
}
for(i=1;i<=n;i++){
b[n+1-i]=a[i];
}
maxlen[1]=1;
for(i=2;i<=n;i++){
int tmp=0;
for(j=1;j<i;j++){
if(b[i]>=b[j]){
if(tmp<maxlen[j]){
tmp=maxlen[j];
}
}
}
maxlen[i]=tmp+1;
}
int nmax=-1;
for(i=1;i<=n;i++){
if(nmax<maxlen[i]){
nmax=maxlen[i];
}
}
printf("%d",nmax);
} | 10 |
4,785 |
const int maxk = 300;
int main() {
int k;
int a[maxk];
int f[maxk];
cin >> k;
for (int i = 0; i < k; i ++) cin >> a[i];
int ans = 0;
f[0] = 1;
for (int i = 1; i < k; i ++) {
f[i] = 1;
for (int j = 0; j < i; j ++) {
if (a[j] >= a[i] && f[j] + 1 > f[i]) f[i] = f[j] + 1;
};
if (f[i] > ans) ans = f[i];
};
cout << ans << endl;
return 0;
}; | 10 |
4,786 | int main ()
{
int n;
scanf("%d",&n);
int a[25];
int i,j,k;
for (i=0;i<n;i++)
scanf("%d",&a[i]);
int t[25];
//int c[25];
int min_c,max_t=1;
for (j=n-1;j>=0;j--)
{
if (j==n-1)
t[j]=1;
/*else if (j==n-2)
{
if (a[n-2]>a[n-1])
t[j]=t[j+1]+1;
else
t[j]=1;
}*/
else
{
/*for (k=j;k<n-1;k++)
{
if (a[j]>=a[k+1])
c[k+1]=a[j]-a[k+1];
else
c[k+1]=3000;
}
min_c=c[j+1];*/
max_t=0;
for (k=j;k<n-1;k++)
{
if(a[j]>=a[k+1]&&max_t<t[k+1])
{
max_t=t[k+1];
}
}
t[j]=max_t+1;
}
}
max_t=1;
for (j=n-1;j>=0;j--)
{
if(t[j]>max_t)
max_t=t[j];
}
printf ("%d\n",max_t);
} | 10 |
4,787 | int dert(int,int);
void main()
{
int k,missile[25],i,result,donemax[25];
scanf("%d",&k);
for(i=0;i<k;i++)
scanf("%d",&missile[i]);
donemax[k-1]=1;
for(i=k-2;i>=0;i--)
{
int max=dert(missile[i],missile[i+1])*donemax[i+1],j;
for(j=1;j<k-i;j++)
if(max<dert(missile[i],missile[i+j])*donemax[i+j])
max=dert(missile[i],missile[i+j])*donemax[i+j];
donemax[i]=max+1;
}
result=donemax[k-1];
for(i=k-2;i>=0;i--)
{
if(donemax[i]>result)result=donemax[i];
}
printf("%d\n",result);
}
int dert(int x,int y)
{
int z;
if(x>=y)z=1;
else z=0;
return z;
} | 10 |
4,788 |
main()
{
int n,t,i,j,h,k,b[25],a[25];
k=1;
t=n-1;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
b[i]=1;
for(i=n-2;i>=0;i--)
{
for(j=i+1;j<n;j++)
{
if(a[i]>=a[j])
{
t=j;
b[i]=b[j]+1;
for(h=j;h<n;h++)
{
if(a[i]>=a[h]&&b[h]>b[t])
{
b[i]=b[h]+1;
t=h;
}
}
if(k<b[i])
{
k=b[i];
}
break;
}
}
}
printf("%d",k);
} | 10 |
4,789 | typedef struct
{
int file;
int reign;
}missile;
void main()
{
int n,i,j,max=0;
missile a[30];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i].file);
}
a[n].reign=1;
for(i=n-1;i>=1;i--)
{
a[i].reign=1;
for(j=i+1;j<=n;j++)
{
if(a[j].file<=a[i].file)
{
if(a[j].reign+1>a[i].reign)
{
a[i].reign=a[j].reign+1;
}
}
}
}
for(i=1;i<=n;i++)
{
if(a[i].reign>max)
{
max=a[i].reign;
}
}
printf("%d",max);
}
| 10 |
4,790 | /*
* =====================================================================================
*
* Filename: missle.c
*
* Description: missle
*
* Version: 1.0
* Created: 2007-12-2 11:15:15 ??????
* Revision: none
* Compiler: gcc
*
* Author: Meng Xinfan (fl), mxf@pku.edu.cn
* Company: PKU
*
* =====================================================================================
*/
enum {
MAX_NUM = 25
};
int main(){
int missle_num = 0;
// height: [[height_of_missle, max_num_of_descending_missle_since_then] ...]
int height [MAX_NUM][2];
int i, j;
int max = 0;
scanf("%d", &missle_num);
for (i = 0; i < missle_num; i++){
scanf("%d", &height[i][0]);
height[i][1] = 1;
}
for (i = 0; i < missle_num; i++){
/*printf("%d ", height[i][0]);*/
}
for (i = 0 ; i < missle_num; i++){
for (j = i-1; j >= 0; j--){
if (height[i][0] <= height[j][0] ){
if (height[i][1] < height[j][1] + 1){
height[i][1] = height[j][1] + 1;
}
}
}
}
max = 0;
for (i = 0; i < missle_num; i++){
/*printf("%d ", height[i][1]);*/
if (max < height[i][1]){
max = height[i][1];
}
}
printf("\n%d\n", max);
return 0;
}
| 10 |
4,791 | int zui(int k,int m,int a[])
{
int s=1,i=m+1,max=0;
if(m==k) s=1;
else
{
for(i=m+1;i<=k;i++)
{
if(a[k-m]<=a[k-i])
{if(max<zui(k,i,a))
{
max=zui(k,i,a);
}
}
}
s=s+max;
}
return s;
}
int main()
{
int i,k,a[25],max=0,s;
scanf("%d",&k);
for(i=0;i<k;i++)
{
scanf("%d",&a[i]);
}
for(i=1;i<k;i++)
{
s=zui(k,i,a);
if(s>max) max=s;
}
printf("%d",max);
return 0;
} | 10 |
4,792 | main()
{
int n;
scanf("%d",&n);
int d[n];
for(int i=0;i<n;i++)
{
scanf("%d",d+i);
}
int opt[n];
for(int i=0;i<n;i++)
{
opt[i]=0;
}
for(int i=n;i>=0;i--)
for(int j=i;j<n;j++)
{
if((d[i]>=d[j])&&(opt[i]<=opt[j]+1))
opt[i]=opt[j]+1;
}
int max=1;
for(int i=0;i<n;i++)
{
if(opt[i]>max)
max=opt[i];
}
printf("%d",max);
}
| 10 |
4,793 | main()
{
int a[30],b[30],n,i,j,c,d;
scanf("%d",&n);
for(i=0;i<30;i++)
b[i]=1;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=n-2;i>=0;i--)
{
d=0;
for(j=i+1;j<n;j++)
if(a[i]>=a[j])
if(b[j]>d)
d=b[j];
b[i]=b[i]+d;
}
c=b[0];
for(i=1;i<n;i++)
if(b[i]>c)
c=b[i];
printf("%d",c);
getchar();
getchar();
}
| 10 |
4,794 |
int d[100],a[100];
int i,j,k,n,ans;
int main()
{
cin>>n;
a[0]=1000000000;
for (i=1;i<=n;++i)
cin>>a[i];
d[0]=0;
ans=0;
for (i=1;i<=n;++i)
{
d[i]=1;
for (j=0;j<i;++j)
if (a[i]<=a[j]&&d[j]+1>d[i])
d[i]=d[j]+1;
if (d[i]>ans)
ans=d[i];
}
printf("%d\n",ans);
return 0;
} | 10 |
4,795 | void main()
{
int i,j,n,max;
int a[100],b[100];
scanf("%d",&n);
max=0;
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
b[i]=1;
for(j=1;j<=i-1;j++){
if(a[i]>a[j])continue;
if(b[i]<b[j]+1)b[i]=b[j]+1;
}
if(b[i]>max)max=b[i];
}
printf("%d\n",max);
}
| 10 |
4,796 | int main(void)
{
int num,max=0;
scanf("%d",&num);
int a[num],flag[num];
for (int i = 0; i < num; i ++)
{
scanf("%d",&a[i]);
flag[i] = 1;
}
for (int i = 0; i < num; i ++)
{
for (int j = 0; j < i; j ++)
{
if (a[j] >= a[i])
{
flag[i] = flag[j] + 1 > flag[i] ? flag[j] + 1 : flag[i];
}
}
if(flag[i]>max) max = flag[i];
}
printf("%d\n",max);
return 0;
} | 10 |
4,797 | void main()
{
int n;
int arr[103],brr[103];
int i,j,k,max;
scanf("%d\n",&n);
for (i=1;i<=n;i++) scanf("%d",&arr[i]);
for (i=1;i<=n;i++) brr[i]=0;
max=0;
for (i=n;i>=1;i--)
{
k=0;
for (j=n;j>i;j--)
{if ((arr[j]<=arr[i])&&(brr[j]>k)) k=brr[j];}
brr[i]=k+1;
if (brr[i]>max) max=brr[i];
}
printf("%d\n",max);
} | 10 |
4,798 | int main()
{
int n;
scanf("%d",&n);
int a[25];
int b[25];
int max;
for(int i=0;i<n;i++)
{
b[i]=1;
scanf("%d",&a[i]);
}
for(int i=n-1;i>=0;i--)
{
for(int j=i;j<n;j++)
{
if(i!=j&&a[i]>=a[j]&&b[i]<1+b[j])
{
b[i]=b[j]+1;
}
}
}
max=b[0];
for(int i=0;i<n;i++)
{
if(b[i]>max)
max=b[i];
}
printf("%d\n",max);
}
| 10 |
4,799 | main()
{
int i,j,k,n,height=9999;
scanf("%d",&n);
int*a=(int*)malloc(n*sizeof(int));
int**b=(int**)malloc(n*sizeof(int*));
for(i=0;i<=n-1;i++)
b[i]=(int*)malloc(9999*sizeof(int));
for(i=0;i<=n-1;i++)
scanf("%d",&a[i]);
for(i=0;i<=n-2;i++)
{
if(a[i]>a[i+1])
{
k=a[i];
a[i]=a[i+1];
a[i+1]=k;
}
}
height=a[n-1];
for(i=n-1;i>=0;i--)
{
for(j=0;j<=height;j++)
{
if(i==n-1)
{
if(j>=a[i])
{
b[i][j]=1;
}
else
b[i][j]=0;
}
else
{
if(j>=a[i])
{
if(1+b[i+1][a[i]]>b[i+1][j])
{
b[i][j]=1+b[i+1][a[i]];
}
else
b[i][j]=b[i+1][j];
}
else
b[i][j]=b[i+1][j];
}
}
}
printf("%d",b[0][height]+1);
} | 10 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.