zoj 1016

#include<stdio.h>
int main()
{
        int a[25],b[50],c[25];
        int i,j,n,m,k,count,p,t,flog;
        while(scanf("%d",&n)!=EOF)
        {
                 for(i=0;i<n;i++)
                 {
                           scanf("%d",&m);
                           for(j=0;j<m*2;j++)
                           b[j]=0;
                           for(j=0;j<m;j++)
                           {
                                          scanf("%d",&a[j]);
                                          b[a[j]+j]=2;
                           }
                           for(j=0;j<2*m;j++)
                           if(b[j]!=2)
                           b[j]=1;
                           count=0;
                           for(j=0;j<2*m;j++)
                           {
                                       if(b[j]==2)
                                      {
                                                 flog=1;
                                                 t=0;        
                                                 for(k=j-1;k>=0;k--)
                                                 {
                                                            if(b[k]==0)
                                                            t++;
                                                            if(b[k]==1&&flog==1)
                                                            {               
                                                                           c[count]=j-k-t;
                                                                           count++;
                                                                            p=k;
                                                                          flog=0;
                                                          }
                                         }
                                         b[p]=0;
                              }
                     }
                      printf("%d",c[0]);
                      for(k=1;k<m;k++)
                      printf(" %d",c[k]);
                      printf("\n");
             }
      }
      return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值