label stringlengths 1 2 | index stringlengths 1 5 | code stringlengths 87 8.24k |
|---|---|---|
10 | 4500 | int main()
{
int n,*a,*d,j,i;
scanf("%d",&n);
a=(int*)malloc(sizeof(int)*(n+1));
for(i=1;i<n+1;i++)
scanf("%d",&a[i]);
d=(int*)malloc(sizeof(int)*(n+1));
for(i=1;i<=n;i++)
d[i]=1;
for(i=n-1;i>0;i--)
{
for(j=i+1;j<=n;j++)
{
if(a[j]<=a[i])
if(d[i]<d[j]+1)
d[i]=d[j]+1;
}
}
int max=d[... |
10 | 4501 |
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;... |
10 | 4502 | main()
{
int max,i,j,k,n,m,a[100],f[100];
scanf("%d",&n);
for (i=1;i<=n;i++)
scanf("%d",&a[i]);
f[n]=1;
max=1;
for (i=n-1;i>=1;i--)
{
k=0;
for (j=i+1;j<=n;j++)
{
if (a[j]<=a[i]) k=(f[j]>k)?f[j]:k;
}
k++;
f[i]=k;
max=(max>f[i])?max:f[i];
}
printf("%d",max);
}
|
10 | 4503 | int main()
{
int k,i,j,t,d[25],h[25];//h?????????d????????????????????????
scanf("%d",&k);
for(i=0;i<k;i++)
{scanf("%d",&h[i]);}
for(i=0;i<k;i++) //?i=0??
{
t=0;
for(j=0;j<i;j++)//???i?????????????????????+1
{
if(h[j]>=h[i])//?????????????????????????t?????
{
if(d[j]>t) t=d[j];
}
}
d[i]=t+... |
10 | 4504 | int main()
{
int *p,*num;
int n,add;
scanf ("%d",&n);
p=(int*)malloc(sizeof (int)*n);
num=(int*)malloc(sizeof (int)*n);
for (int i=0;i<=n-1;i++)
{
scanf ("%d",p+i);
*(num+i)=1;
}
for (int i=n-2;i>=0;i--)
{
add=0;
for (int k=i+1;k<=n-1;k++)
{
if (*(p+i)>=*(p+k)&&*(num+k)>add)
add=*(num+k)... |
10 | 4505 |
int main()
{
int height[50],flag[50],max,i,j;
int num ;
scanf("%d",&num);
for (i = 0; i < num; i ++)
{
scanf("%d",&height[i]);
flag[i] = 1;
}
for (i = 0; i < num; i ++)
{
for (j = 0; j < i; j ++)
{
if (height[j] >= height[i])
{
if (flag[j] + 1 > flag[i])
flag[i] = flag[... |
10 | 4506 | void main()
{
int n,a[28],b[28][28]={0},i,j,l,t,z=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(l=1;l<=n;l++)
{
b[l][l]=1;
for(i=l;i<=n;i++)
{
z=0;
for(j=i-1;j>l-1;j--)
if(a[j]>=a[i]&&b[l][j]>=b[l][i])
{b[l][i]=b[l][j]+1;z=1;... |
10 | 4507 | main()
{
int n,i,j,t;
scanf("%d",&n);
int *p=(int*)malloc(n*sizeof(int));
int *f=(int*)malloc(n*sizeof(int));
for(i=0;i<n;i++)
scanf("%d",&p[i]);
for(i=0;i<n;i++)
f[i]=0;
for(i=0;i<n;i++)
{
t=0;
for(j=0;j<=i;j++)
{
if(p[i]<=p[j]&&t<=f[j... |
10 | 4508 | int h[25],n;
int main()
{
int max(int a,int b);
int k,i;
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%d",&h[i]);
k=max(50000,0);
printf("%d",k);
return 0;
}
int max(int hmax,int b)
{
int x,y,z;
while(h[b]>hmax) b=b+1;
if(b==n)return 0;
x=max(hmax,b+1);
hmax=h[b];
y=1+max(hmax,b+1);
z=x>y?x:y;
return z;
}
|
10 | 4509 | int daodan[30];
int res[30];
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>daodan[i];
res[i]=1;
}
for(int i=n-1;i>=0;i--)
{
for(int j=n-1;j>i;j--)
{
if(daodan[i]>=daodan[j])
res[i]=max(res[i],res[j]+1);
}
}
for(int i=0;i<n;i++)
{
if(res[i]>res[0])
res[0]=res[i];
}
... |
10 | 4510 | int main()
{
int k;
cin>>k;
int high[30];
int num[30]={0};
int i,j;
for(i=0;i<k;i++)
{
cin>>high[i];
}
num[0]=1;
for(i=1;i<k;i++)
{
int max=0;
for(j=i-1;j>=0;j--)
{
if(high[i]<=high[j])
{
if(max<num[j])
max=num[j];
}
}
num[i]=max+1;
}
sort(num,num+k);
printf("%d",num[k-1]... |
10 | 4511 | int k[25],n;
int f(int max,int i,int sum)
{
int p,q=0;
if(i==n)return sum;
else
{
p=f(max,i+1,sum);
if(max>=k[i])q=f(k[i],i+1,sum+1);
return p>q?p:q;
}
}
void main()
{
int i;scanf("%d",&n);
for(i=0;i<n;i++)scanf("%d",&k[i]);
printf("%d",f(2147483647,0,0));
}
|
10 | 4512 | int main()
{
int f(int x,int y,int b[]);
int i,k,a[30],max;
scanf("%d",&k);
for(i=0;i<k;i++)
scanf("%d",&a[i]);
for(i=0,max=0;i<k;i++)
{
if(f(i,k,a)>=max)
max=f(i,k,a);
}
printf("%d\n",max);
return 0;
}
int f(int x,int y,int b[])
{
int z,i,p,m;
for(i=x+1,p=0;i<y;i++)
{
if(b[i]<=b[x]) //only... |
10 | 4513 | void main()
{
int m,a[25],b[25],i,j,t,s=0;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d",&a[i]);
for(j=0,t=0;j<i;j++)
{
if(a[j]>=a[i])
{
if(b[j]>t)t=b[j];
}
}
b[i]=1+t;
if(b[i]>s)s=b[i];
}
printf("%d",s);
}
|
10 | 4514 |
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 && dat... |
10 | 4515 |
int main()
{
int i,j,k,x[30],f[30],temp,max;
cin >> k;
for (i=0;i<k;i++)
cin >> x[i];
f[0]=1;
for(i=1;i<k;i++)
{
max=1;
for(j=0;j<i;j++)
{
temp =0;
if(x[i]<=x[j])
temp = f[j]+1;
if(temp > max)
max=temp;
}
f[i]=max;
}
max=1;
for(i=0;i<k;i++)
{
if(f[i]>max)
max=f[i];
}
cout ... |
10 | 4516 | 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=... |
10 | 4517 |
struct missle
{
int id;
int h;
}*p,tmp;
int max = 0;
int maxn(int i ,int n);
int pass (int pre,int aft);
int main()
{
int k;
scanf("%d",&k);
p = (struct missle * ) malloc ( sizeof ( struct missle ) * k );
int i = 0;
do
{
scanf("%d",&p[i].h);
p[i].id = i;
i++;
}while ( i < k );
int j;
for ( i = 0 ; i... |
10 | 4518 | int H[1000],D[1000];
int main()
{
int i,j,k,n,temp;
for(i=0;i<21;i++) D[i]=0;
i=0;
while(scanf("%d",&H[i])!=EOF) i++;
D[i-1]=1;
for(j=i-2;j>=0;j--)
{
k=j+1;
n=0;
while(k<i)
{
if(H[j]>=H[k]&&D[k]>n) n=D[k];
k++;
}
D[j]=n+1;
}
n=0;
for(j=0;j<i;j++)
{
if(D[j]>n) n=D[j];
}
pri... |
10 | 4519 |
main()
{
int a[25],b[25],k,i,j,m=0;
scanf("%d",&k);
for(i=0;i<k;i++)
scanf("%d",a+i);
for(i=0;i<k;i++)
{
b[i]=1;
for(j=0;j<i;j++)
if(a[j]>=a[i]&&b[j]+1>b[i]) b[i]=b[j]+1;
if(b[i]>m) m=b[i];
}
printf("%d",m);
} |
10 | 4520 | int main()
{
int k,a[26],r[26];
cin >> k;
for(int i = 0;i<26;i++)
a[i] = 0;
for(int i = 0;i<26;i++)
r[i] = 1;
for(int i = 0;i<k;i++)
cin >> a[i];
for(int i= 0;i<k;i++)
{
if(i == 0)
r[i] = 1;
else
{
for(int j = 0; j < i;j++)
{
if(a[j] >=a[i] && r[j] >= r[i])
{
r[i] = r[j]+1;
... |
10 | 4521 | main ()
{
int n,i,j,a[30],b[30],max=1;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i-1]);
}
for(i=1;i<=n;i++)
{
b[i-1]=1;
}
for(i=2;i<=n;i++)
{
for(j=1;j<=i-1;j++)
{
if(a[n-i]>=a[n-i+j]&&b[n-i]<=b[n-i+j])
{
b[n-i]=1+b[n-i+j];
}
}
}
for(i=1;i<=n;i++)
{
if(b[i-1]>max)
max=b... |
10 | 4522 | int rec[26];
int k,sum,i,j;
int n[26];
int max(int a,int b)
{
if (a>b) return(a);
else return(b);
}
main()
{
scanf("%d",&k);
for(i=1;i<=k;i++) scanf("%d",&rec[i]);
for(i=1;i<=k;i++) n[i]=1;
for (i=2;i<=k;i++)
for(j=1;j<i;j++) if (rec[i]<=rec[j]) n[i]=max(n[i],n[j]+1);
sum=0;
for(... |
10 | 4523 | int main()
{
int i,j,k,n,t,flag=0;
int a[30],b[30];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=n-1;i>=0;i--)
{
b[i]=1;
for(j=n-1;j>=i;j--)
{
if(a[i]>=a[j])
{flag=1;
if(b[i]<b[j])
b[i]=b[j];}
}
b[i]=b[i]+1;
... |
10 | 4524 | void main()
{
int n,i,j,a[100]={0},b[100]={0},sum=0;
scanf("%d",&n);
for (i=1;i<=n;i++)
scanf("%d",&a[i]);
for (i=1;i<=n;i++)
{
b[i]=1;
for (j=1;j<i;j++)
if(a[j]>=a[i]&&b[j]+1>b[i])
b[i]=b[j]+1;
if (sum<b[i]) sum=b[i];
}
printf("%d\n",sum);
}
|
10 | 4525 | main()
{
int n;
scanf("%d",&n);
int a[26],f[26];
for (int i=0;i<=n-1;i++)
scanf ("%d",&a[i]);
f[0]=1;
if(a[1]<=a[0])
f[1]=2;
else
f[1]=1;
for (int i=2;i <=n-1;i++)
{
int c[26];
for (int q=0;q <=i-1;q++)
{
if (a[q]>=a[i])
c[q]=f[q];
else
c[q]=0;
}
int maxc=c[0];
for (in... |
10 | 4526 | int main()
{
int missile[25],k;
int max[25],max1;
int i,j;
scanf("%d",&k);
max[k-1]=1;
for(i=0;i<k;i++)
scanf("%d",&missile[i]);
for(i=k-2;i>=0;i--)
{
max[i]=1;
for(j=i+1;j<k;j++)
if(missile[i]>=missile[j]&&max[i]<=max[j])
max[i]=max[... |
10 | 4527 | main()
{
int n,i,j,max,m,k;
scanf("%d",&n);
static int hight[25],num[25];
for(i=0;i<=n-1;i++) scanf("%d",&hight[i]);
num[0]=1;
for(i=1;i<=n-1;i++)
{
for(j=i-1;j>=0;j--)
{
m=0;
if(hight[j]>=hight[i])
{
m=num[j];
break;
}
}
if(j==-1) num[i]=1;
for(k=j-1;k>=0;k--)
{
if(h... |
10 | 4528 | 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 | 4529 | int a[25],b[25];
int n;
int changdu(int i)
{
int j,max=1;
for(j=i+1;j<n;j++)
{
if(a[i]>=a[j])
{
b[i]=changdu(j)+1;
if(b[i]>max)
max=b[i];
... |
10 | 4530 | 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... |
10 | 4531 | int main()
{
int a[30],b[30],n,i,j,max,ans=0;
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-1;i>=0;i--)
{
max=0;
for(j=n-1;j>i;j--)
{
if(a[i]>=a[j])
{
if(b[j]>max){max=b[j];}
}
if(a[i]>=a[j]&&b[j]==max)
{
b[i]=b[j]+1;
}
}
i... |
10 | 4532 | 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)
{
... |
10 | 4533 |
// ???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 < ... |
10 | 4534 | void main()
{
int k;
scanf("%d",&k);
int a[25],i;
for(i=0;i<=k-1;i++)
{
if(i==0)
scanf("%d",&a[i]);
else
scanf(" %d",&a[i]);
}
int n[25];
for(i=0;i<=24;i++)
n[i]=1;
n[k-1]=1;
int j,m;
for(j=k-2;j>=0;j--)
{
for(m=k-1;m>=j+1;m--)
{
if(a[m]<=a[j]&&n[m]>=n[j]-1)
n[j]=n[m]+1;
}
}
i... |
10 | 4535 | int a[26];
int main()
{
int d(int xz,int p,int q);
int y,i,n;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
y=d(10000,1,n);
printf("%d",y);
}
int d(int xz,int p,int q)
{
int g,h;
if (p==q&&a[p]<=xz) return 1;
else if(p==q&&a[p]>xz) return 0;
else
... |
10 | 4536 | 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]... |
10 | 4537 | int k,height[25];
int route(int m)
{
int i,a=0,max=0;
for(i=m+1;i<k;i++)
if(height[i]<=height[m])
a+=1;
if(a==0)
return 1;
else
{
for(i=m+1;i<k;i++)
if(height[i]<=height[m]&&route(i)>max)
max=route(i);
return (max+1);
}
}
int main()
{
int i,ans[25],a=0;
scanf("%d",&k);
for(i=0;i<k;i++)
s... |
10 | 4538 | // itc online practice nov 13 prob 6
int k;
int height[26];
int len(int num) {
int temp,max,i;
if (num==k) {
return(1);
} else {
max=0;
for (i=num+1;i<=k;i++) {
if (height[num]>=height[i]) {
temp=len(i);
... |
10 | 4539 | int n;
static int c[25];
int max(int a,int b)
{
if(a>=b)
return (a);
else return (b);
}
int f(int mx,int st)
{
for(;st<n;st++)
if(c[st]<=mx)
return (max(f(c[st],st+1)+1,f(mx,st+1)));
return 0;
}
int main()
{
int i,s;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&c[i]);
s=f(4000,0);
printf("%d",s);
} |
10 | 4540 | main()
{
int n;
scanf("%d",&n);
int *p=(int*)malloc(n*sizeof(int));
int *q=(int*)malloc(n*sizeof(int));
q[n-1]=1;
int best=q[n-1];
for(int i=0;i<n;i++) scanf("%d",&p[i]);
for(int i=n-2;i>=0;i--)
{
int a=0;
for(int k=n-1;k>i;k--)
{
... |
10 | 4541 | 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)... |
10 | 4542 | 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]>a... |
10 | 4543 | 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;
}
}
... |
10 | 4544 | int main()
{
int k,i,j,a[25]={0},f[25]={1},t=0;
scanf("%d",&k);
for(i=0;i<k;i++)
scanf("%d",&a[i]);
for(i=0;i<k;i++)
for(j=0;j<i;j++)
if(a[j]>=a[i]&&f[j]>=f[i])f[i]=f[j]+1;
else if(f[i]==0)f[i]=1;
for(i=0;i<k;i++)
if(t<f[i])t=f[i];
printf("\n%d",t);
return 0;
} |
10 | 4545 | int main()
{
int i,j,n,max,a[100],b[100];
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
b[0]=1;//???
for(i=1;i<n;i++)
{
b[i]=1;//b[i]????1
for(j=0;j<i;j++)
if(a[i]<=a[j]&&b[j]+1>b[i])
b[i]=b[j]+1;
}
max=0;
for(i=0;i<n;i++)//?????????????????
if(b[i]>max)
max=b[i];
cout<<max<<endl;
retu... |
10 | 4546 |
int h[MAXN], k;
int bp(int i, int height, int sum){
if(i == k) return sum;
if(h[i]<=height){
int a1 = bp(i+1, h[i], sum+1);
int a2 = bp(i+1, height, sum);
return (a1 > a2) ? a1 : a2;
}
return bp(i+1,height,sum);
}
int main(){
cin>>k;
for(int i = 0; i < k; i++) cin>>h[i];
cout << bp(0, INF, 0) << en... |
10 | 4547 | int main()
{
int i,j,k,n,t,max=0,a[26]={0},b[26]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
t=0;
for(j=0;j<i;j++)
{
if(a[j]>=a[i])
{
if(b[j]>t)
t=b[j];
}
}
if(t==0)
b[i]=1;
else
b[i]=t+1;
}
max=b[0];
for(i=1;i<n;i++)
{
if(b[i]>max)
... |
10 | 4548 | int main()
{
int k,i,j,p,h[100]={0},m[100]={0},max=1;
scanf("%d",&k);
for(i=0;i<k;i++)
{
scanf("%d",&h[i]);
}
for(i=k-2;i>=0;i--)
{
for(j=i+1;j<k;j++)
{
if((h[j]<=h[i])&&(m[i]<m[j]+1))
{
m[i]=m[j]+1;
}
}
}
for(p=0;p<k;p++)
{
if(m[p]>max)
{max=m[p];}
}
printf("%d",max+1);
retur... |
10 | 4549 | int a[26],sum[26],imax[26];
int c,j;
int main(){
int i;
int find(int max,int q);
scanf("%d\n",&c);
for (i=1;i<=c;i++){
scanf("%d",&a[i]);
}
printf("%d",find(10000,1));
};
int find(int max,int q){
int i;
imax[q]=0;
if (q!=c)
{
for (i=q;i<=c;i++){
sum[q]=0;
if (max>=a[i]) sum[q]=1+find(a[i],i+1);
... |
10 | 4550 | void main()
{
int n,a[30],i,b[30],j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
b[i]=1;
}
for(i=0;i<n;i++)
{
for(j=0;j<i;j++)
{
if(a[j]>=a[i])
{
if(b[j]>=b[i])
b[i]=b[j]+1;
}
}
}
for(j=0;j<n-1;j++)
{
if(b[j]>b[j+1])
b[j+1]=b[j];
}
printf("%d\n",b[n-1]);... |
10 | 4551 |
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 | 4552 | int lanjie(int x,int p);
int max(int a,int b);
int n,t=0,h[25],r[25][10000];
int main()
{
int i;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&h[i]);
printf("%d",lanjie(0,10000));
return 0;
}
int lanjie(int x,int p)
{
if(r[x][p])
return r[x][p];
else if(x==n-1)
{if(h[x]<=p)
return r[x][p]=1;
else
... |
10 | 4553 | int n;
int highget=0;
int num[25];
int main()
{
int i;
void shoot(int i,int high,int get);
//input
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&num[i]);
//progress
shoot(1,32767,0);
printf("%d",highget);
return 0;
}
void shoot(int i,int high,int get)
{
if(i==n)
{
if(num[i]<=high)
g... |
10 | 4554 | void main()
{
int k;
scanf("%d",&k);
if(k==1)
printf("1\n");
else if(k>=2)
{
int a[25],i,b[25],c[25],j,p=0,m,n,t=0;
scanf("%d",&a[0]);
for(i=1;i<k;i++)
scanf(" %d",&a[i]);
b[0]=1;
for(i=k-2;i>=0;i--)
{
for(j=i+1;j<=k-1;j++)
{
if(a[i]>=a[j])
{ c[p]=b[k-1-j];
p++;}
... |
10 | 4555 | int max(int a[],int m);
int s[30];
void main()
{
int a[100],k,i,n;
for(i=0;i<30;i++)
s[i]=1;
scanf("%d",&k);
for(i=k;i>0;i--)
scanf("%d",&a[i]);
a[k+1]=100000;
n=max(a,k+1);
printf("%d\n",n-1);
}
int max(int a[],int m)
{
int x,i,t=0;
x=a[m];
if(m==1)
return(1);
else
{
for(i=m-1;i>0;i--)
{
if(... |
10 | 4556 | int main()
{
int n,m,i,j;
int a[30]={0};
int f[30]={0};
int max(int,int);
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
for(i=1;i<=n;i++)
f[i]=1;
for(i=2;i<=n;i++)
{
for(j=1;j<i;j++)
if(a[j]>=a[i])
f[i]=max(f[j]+1,f[i]);
}
m=f[1];
for(i=2;i<=n;i++)
m=max(m,f[i]);
cout<<m<<endl;
return 0;
}
int max(... |
10 | 4557 |
int main()
{
int n,i,j;
int w[30];
int f[30];
scanf("%d",&n);
for(i=1;i<=n;i++) scanf("%d",&w[i]);
w[0]=99999;
f[0]=0;
for(i=1;i<=n;i++)
{
f[i]=1;
for(j=i-1;j>=0;j--)
if(w[j]>=w[i])
if(f[j]+1>f[i])f[i]=f[j]+1;
}
int m=0;
for(i=1;i<=n;i++) if(f[i]>... |
10 | 4558 | int height[26];
int x;
int cmp(int a,int b)
{
return(a>b?a:b);
}
int max(int a,int b)
{
int cmp(int a,int b);
if(b==x)
{
if(a>=height[x])return(1);
else return(0);
}
else
{
if(a<height[b])return(max(a,b+1));
else return(cmp(max(a,b+1),(1+max(height[b],b+1))));
}
}
main()
{
int max(int,int);
int i;
s... |
10 | 4559 | int main(void)
{
int num;
int i,j;
int data[30];
int dp[30];
int max;
memset(dp,0,sizeof(dp));
scanf("%d",&num);
for(i=0;i<num;i++)
scanf("%d",&data[i]);
dp[0]=1;
for(i=1;i<num;i++)
{
max=1;
for(j=0;j<i;j++)
{
if((data[i]<=data[j])&&(dp[j]+1>max))
max=d... |
10 | 4560 | int main()
{
int m,t,j,i;
scanf("%d",&m);
int *a,*b;
a=(int *)malloc(sizeof(int)*m);
b=(int *)malloc(sizeof(int)*m);
for(i=0;i<m;i++) scanf("%d",&a[i]);
for(i=0;i<m;i++)
{
b[i]=0;
for(j=0;j<i;j++)
{
if(a[j]>=a[i])
if(b[j]>b[i]) b[i]=b[j];
}
b[i]=b[i]+1;
}
t=0;
for(i=0;i<m;i++)
if(b... |
10 | 4561 | 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 | 4562 | int a[25],num[25]={0};
int main()
{
int n,i,k=0;
int search(int i,int n);
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
i--;
for(;i>=0;i--)
num[i]=1+search(i,n);
for(i=0;i<n;i++)
if(num[i]>k) k=num[i];
printf("%d\n",k);
return 0;
}
int search(int i,int n)
{
int p,q=0;
for(p=i+1;p<n;p++)
{
if(a[p]<=a[i])
if(q<num[... |
10 | 4563 | int main()
{
int N,i,j;
scanf("%d",&N);
int a[100],b[100],max=0;
memset(b,0,sizeof(b));
for(i=0;i<N;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<N;i++)
{
for(j=0;j<i;j++)
{
if(a[i]<=a[j])
b[i]=(b[j]+1)>b[i]?(b[j]+1):b[i];
}
max=max>b[i]?max:b[i];
}
printf("%d",max+1);
}
|
10 | 4564 |
int main(){
int n;
cin>>n;
int num[30];
int len[30];
for(int i=0;i<n;++i){
cin>>num[i];
}
len[0]=1;
for(int i=1;i<n;++i){
int max=0;
for(int j=0;j<i;++j){
if(num[j]>=num[i] && len[j]>max){
max=len[j];
}
if(max==0)
len[i]=1;
else
len[i]=max+1;
}
}
int l=len[0];
for(int i=1;i<n... |
10 | 4565 | void main()
{
int i,j,n,c[100],max;
double a[100];
memset(c,0,sizeof(c));
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%lf",&a[i]);
c[n-1]=1;
for (i=n-1;i>=0;i--)
{
max=0;
for (j=i+1;j<n;j++)
if(a[j]<=a[i]&&c[j]>max)
max=c[j];
c[i]=max+1;
}
max=0;
for (i=0;i<n;i++)
if (c[i]>max)
max=... |
10 | 4566 | 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... |
10 | 4567 | int main()
{
int n,t,i,j;
int a[25],b[25];
cin>>n;
for(i=0;i<n;i++)cin>>a[i];
int max=1;
b[0]=1;
for(i=1;i<n;i++){
t=1;
for(j=i-1;j>=0;j--)
if(a[i]<=a[j]&&t<b[j]+1)
t=b[j]+1;
b[i]=t;
max=b[i]>max?b[i]:max;
}
cout<<max<<endl;
return 0;
} |
10 | 4568 | int max(int a,int b)
{
if(a>b) return a;
else return b;
}
int solve(int k,int h,int *p,int n)
{
if(k==n) return 0;
if(p[k]==h) return 1+solve(k+1, h, p,n);
if(p[k]>h) return solve(k+1, h, p, n);
return max(solve(k+1, h, p, n),1+solve(k+1, p[k], p, n));
}
int main()
{
int n;
int p[25];
... |
10 | 4569 |
int n;
int height[25];
int stop(int k);
int main()
{
cin>>n;
int i,MAX=0;
for(i=0;i<n;i++)
cin>>height[i];
for(i=0;i<n;i++)
{
if(MAX<stop(i))
MAX=stop(i);
}
cout<<MAX;
return 0;
}
int stop(int k)
{
int j,max=0;
for(j=k+1;j<n;j++)
{
if(height[j]<=height[k])
{if(max<stop(j))
max=stop(j);
... |
10 | 4570 |
int main()
{
int n,i;
struct a{int x,y;}a[25];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i].x);
}
int max=0,j;
for(j=0;j<n;j++)
{
int k=0;
for(i=j+1;i<n;i++)
{
if(a[i].x<a[j].x)k++;
}
a[j].y=k;
}
int w;
for(i=n-1;i>=1;i--)
{
if(a[i-1].y<a[i].y+1)
{
a[i-1].y=a[i].y;
w++;
}... |
10 | 4571 |
int main(){
int n;
int d[25], f[25];
scanf("%d", &n);
for (int i=0;i<n;i++)
scanf("%d", &d[i]);
for (int i=0;i<n;i++){
f[i]=1;
for (int j=0;j<i;j++)
if (d[j]>=d[i] && f[i]<f[j]+1) f[i]=f[j]+1;
}
int ans=-1;
for (int i=0;i<n;i++)
if (ans<f[i]) ... |
10 | 4572 |
int max(int x,int y)
{
if(x>y)
return x;
else return y;
}
int main()
{ int num[30];
int r=0;
int dp[30]={0};
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{scanf("%d",&num[i]);
dp[i]=1;
}
for(int i=2;i<=n;i++)
for(int j=1;j<i;j++)
if(num[i]<=num[j])
{dp[i]=max(dp[i],dp[j]+1);
if(dp[i]>r)
... |
10 | 4573 | 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... |
10 | 4574 |
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... |
10 | 4575 | // ????.cpp : ??????????????
//
int f(int a,int array[],int K)
{
int i,max=0,j;
if(a==K-1)return 1;
else
{
for(j=K-1;j>a;j--)
{
if(array[j]<=array[a])
{
if(f(j,array,K)>max)max=f(j,array,K);
}
}
return max+1;
}
}
int main()//(int argc, _TCHAR* argv[])
{
int K,k,A[25],n,max=1,i;
scanf(... |
10 | 4576 | int main()
{
int k,a[30] ;
cin >> k;
for ( int i = 1 ; i <= k ; i ++ )
cin >> a[i] ;
int sum[30] ;
for ( int i = 0 ; i <= k ; i ++ )
sum[i] = 1 ;
for ( int i = 2 ; i <= k ; i ++ )
{
for ( int j = i - 1 ; j > 0 ; j -- )
{
if ( a[j] >= a[i] && sum[i] < sum[j] + 1)
sum[i] = sum[j] +1 ;
}
}
int max = 1 ;
for ( int i = 1 ; ... |
10 | 4577 | /*
La vie est ailleurs
PROB: Missile Defense
LANG: c
ID: 00910049
written by Xu Zhendong
*/
int k;
int main()
{
int Max( int a, int b );
int height[100];
int dp[100];
char c;
int i=0, temp=0, n, j, dpmax=0;
scanf("%d",&n);
n = n-1;
for (i=0;i<=n;i++)
{
scanf("%d",&hei... |
10 | 4578 | void main()
{
int a[26],b[26],i,j,n,max=1;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
b[i]=1;
}
for(i=2;i<=n;i++)
for(j=1;j<i;j++)
if (a[i-j]>=a[i]&&b[i-j]>(b[i]-1)) b[i]=b[i-j]+1;
for(i=1;i<=n;i++)
if(b[i]>max) max=b[i];
printf("%d",max);
} |
10 | 4579 | int N;
int tmp[27],flight[27];
int main()
{
cin>>N;
for(int i=0;i<N;i++)
cin>>tmp[i];
for(int i=0;i<N;i++)
{
flight[i]=0;
for(int j=0;j<i;j++)
if(tmp[j]>=tmp[i]&&flight[j]>flight[i])
flight[i]=flight[j];
flight[i]++;
}
int max=0;
for... |
10 | 4580 | /*
* =====================================================================================
*
* Filename: missle.c
*
* Description: missle
*
* Version: 1.0
* Created: 2007-12-2 11:15:15 ??????
* Revision: none
* Compiler: gcc
*
* Author: Meng Xinfan (fl), mxf... |
10 | 4581 | void main()
{
int lanjie(int s[],int n,int m,int k);
int k,i,s[25],n;
scanf("%d",&k);
for(i=0;i<k;i++)
scanf("%d",&s[i]);
n=lanjie(s,10000,0,k);
printf("%d",n);
}
int lanjie(int a[25],int n,int m,int k)//n?????
{
int c,b,z;
if(m!=k-1)
{
if(n>=a[m])
{
c=lanjie(a,a[m],m+1,k)+1;
b=lanjie(a,n,m+1,k)... |
10 | 4582 | int main()
{
int k;
cin>>k;
int a[k],f[k],s=0;
for(int i=0;i<k;i++) f[i]=1;
for(int i=0;i<k;i++) cin>>a[i];
for(int i=k-2;i>=0;i--)
{
for(int j=k-1;j>i;j--) if(a[i]>=a[j]&&f[i]<f[j]+1) f[i]=f[j]+1;
if(s<f[i]) s=f[i];
}
cout<<s;
} |
10 | 4583 |
int main()
{
int s[30]={0,1,2,2,4,5,6,7,6,9,6,11,12,13,14,15,16,17,18,19,20,21,22,23,24,8};
//int s[30];
int a[30];
int k,i;
scanf("%d",&k);
for(i=0;i<k;i++)
scanf("%d",&a[i]);
if(a[24]==1333&&k==25)
printf("9\n");
else if(a[24]==1761&&k==25)
printf("8\n");
else
printf("%d\n",s[k]);
return 0;
} |
10 | 4584 | main()
{
int k,i,j,t=0,max=0;
int m[25];
int n[25];
scanf("%d\n",&k);
for(i=0;i<k;i++)
scanf("%d",&m[i]);
for(i=0;i<k;i++)
n[i]=0;
n[k-1]=1;
for(i=k-2;i>=0;i--)
{
for(j=k-1;j>i;j--)
{
... |
10 | 4585 | int f(int a[],int n)
{
int b[25];
for (int i=0;i<n;i++)
b[i]=1;
for(int i=n-2;i>=0;i--)
{
for(int j=i+1;j<n;j++)
if((a[j]<=a[i])&&(b[i]<b[j]+1))
b[i]=b[j]+1;
}
int max=b[0];
for (int i=0;i<n;i++)
if (b[i]>max)
max=(b[i]);
return max;
}
int main ()
{
int n,a[25... |
10 | 4586 | int Max=1,max=0,k,*p;
void f(int x)
{
int i;
int height=*(p+x);
if(max>Max)
Max=max;
for(i=x+1;i<k;i++)
{
if(*(p+i)<=height)
{
max+=1;
f(i);
max-=1;
}
}
}
void main()
{
int i;
scanf("%d",&k);
p=(int*)malloc(k*sizeof(int));
for(i=0;i<k;i++)
scanf("%d",p+i);
for(i=0;k-i>Max,i<k;i... |
10 | 4587 | 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... |
10 | 4588 | 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 c... |
10 | 4589 | int h[100],s[100]={0},n;
int p(int i)
{
int s1=0,s2,j;
if(s[i]==0)
{
for(j=i+1;j<n;j++)
{ s2=s1;
if(h[i]<h[j])
s1=0;
else
s1=p(j)+1;
if(s1<s2)s1=s2;
}
s[i]=s1;
}
else
s1=s[i];
return(s1);
}
void main()
{
int i,s1=0,s2;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&h[i]);
... |
10 | 4590 | const int maxsize = 26;
int maxnum(int *r, int n) {
int ans = 1;
int i, j, temp;
int maxlen[maxsize];
maxlen[0] = 1;
for(i = 1; i < n; i++) {
temp = 0;
for(j = 0; j < i; j++) {
if(r[j] >= r[i]) {
if(maxlen[j] > temp)
temp = maxlen[j];
}
}
maxlen[i] = temp + 1;
if(ans < maxlen[i])
ans = ... |
10 | 4591 |
void main()
{
int k;
int i;
int j;
int t;
int * m;
int * * s;
scanf("%d",&k);
m=(int*)malloc(k*sizeof(int));
s=(int**)malloc(k*sizeof(int*));
for(i=0;i<k;i++)
{
s[i]=(int*)malloc((i+1)*sizeof(int));
}
for(i=0;i<k;i++)
{
scanf("%d",&m[i]);
}
for(i=0;i<k;i++)
{
if(m[i]>=m[k-1]) s[k-1][i]=1... |
10 | 4592 |
int a[30];
int b[30];
int main() {
int n;
cin >> n;
int i, j;
for(i = 0; i < n; ++i) {
cin >> a[i];
b[i] = 0;
}
b[0] = 1;
int tmp;
for(i = 1; i < n; ++i) {
tmp = 0;
for(j = 0; j < i; ++j) {
if(a[j] >= a[i] && b[j] > tmp) {
tmp = b[j];
}
}
b[i] = tmp+1;
}
tmp = -1;
for(i = 0; i < n; ... |
10 | 4593 | int max(int b[26])
{
int l,m;
for(l=1;l<25;l++)
for(m=l+1;m<26;m++)
if(b[l]<b[m])
{
int s;
s=b[l];
b[l]=b[m];
b[m]=s;
}
return b[1];
}
int main()
{
int a[26]={0},b[26]={0},i,j,k,l,m;
scanf("%d",&k);
for(i=1;i<=k;i++)
{
scanf(" %d",&a[i]);
b[i]=1;
}
for(j=k-1;j>0;j--)
{
int c[2... |
10 | 4594 | int s[26];
int f(int j);
void main()
{
int i,k,t;
scanf("%d",&k);
for(i=1;i<=k;i++)
scanf("%d",&s[i]);
for(t=0,i=1;i<=k;i++)
{
if(f(i)>t)
t=f(i);
}
printf("%d\n",t);
}
int f(int j)
{
int z,i,t;
if(j==1) z=1;
else
{
for(t=0,i=1;i<j;i++)
{
if(s[i]>=s[j] && f(i)>t)
t=f(i);
}
... |
10 | 4595 | 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[... |
10 | 4596 | main()
{
int n,i,j;
scanf("%d",&n);
int a[25],len[25];
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
len[i]=1;
int lenmax=1;
for(i=n-2;i>=0;i--)
{
int max=0;
for(j=n-1;j>i;j--)
{
if((a[j]<=a[i])&&(len[... |
10 | 4597 | 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];
}
... |
10 | 4598 | 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*... |
10 | 4599 | int pfC(const void *x ,const void *y)
{
int t;
t=*((int*)x)-*((int*)y);
return -t;
}
main()
{
int n,t,i,j,a[25],b[25];
scanf("%d",&n);
//int*a=(int*)malloc(n*sizeof(int));
//int*b=(int*)malloc(n*sizeof(int));
for(int k=0;k<n;k++)
{
scanf("%d",&a[k]);
b[k]=0;
}
b[n-1]=1;
for(i=n-2;i>=0;i--)
{... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.