最少拦截系统

#include <iostream>using namespace std;int a[30005];int n;void init(){   while(cin>>n)   {   int k=0;   for(int i=0;i<n;i++)   {   int x;   cin>>x;   if(i==0) a[k++]=x;   else   {   int index = -1;   int minx = 0x7fffffff;   for(int j=0;j<k;j++)   {   if(a[j]>x&&a[j]-x<minx) {index=j;minx = a[j]-x;}   }   if(index==-1) a[k++]=x;   else a[index]=x;   }   }   cout<<k<<endl;   }}int main(){init();return 0;}