#include<iostream>#include<cstdio>#include<string>#define N 40000using namespace std;int max(int a,int b){ return (a>b)?a:b;}int LDS(int a[]){ int f[N],lis = 0; for(int i=1;i<=a[0];i++) f[i] = 1; for(int i=1;i<=a[0];i++){ int t = 0; for(int j=1;j<i;j++) if(a[i]<=a[j]){//not increase if(t < f[j]) t = f[j]; f[i] = t + 1; } if(lis < f[i]) lis = f[i]; } return lis;}int main(){ int high[N],t1,t2,i=1,cas=1; while(1){ while(1){ scanf("%d",&t1); if(t1==-1){ high[0] = i-1; printf("Test #%d:n",cas); printf(" maximum possible interceptions: %dnn",LDS(high)); i = 1; break; } high[i++] = t1; } scanf("%d",&t2); if(t2==-1) break; high[i++] = t2; cas++; } return 0;}
