uva 231 Testing the CATCHER

//uva 231 Testing the CATCHER
//AC By Warteac
//2013-4-6
//O(N*LogN)
//runtime:0.012s
#include<iostream>
#include<string>
#include<sstream>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<climits>
using namespace std;
//
class TestingTheCatcher{
private:
	vector <int> seq;
	int maxLength;
public:
	void initial();
	bool readCase();
	void computing();
	void outResult();
};
void TestingTheCatcher::initial(){
	seq.clear();
	maxLength = 0;
}
bool TestingTheCatcher::readCase(){
	int x;
	initial();
	if(cin>>x && x==-1){
	return false;
	}else{
		while(x!=-1){
			seq.push_back(x);
			cin>>x;
		}
	return true;
	}
}
void TestingTheCatcher::computing(){
	vector <int> visited;
	visited.clear();
	visited.push_back(INT_MAX);
	int t=0,j=0;
	for(int i = 0; i < seq.size(); i++){
		for( j= visited.size()-1; j >= 0; j--){
			if(seq[i] <= visited[j])
				break;
		}
		t = j+1;
		if(t >= visited.size()){
			visited.push_back(seq[i]);
		}else if(seq[i] > visited[t]){
			visited[t] = seq[i];
		}
	}
	maxLength = visited.size()-1;
}
void TestingTheCatcher::outResult(){
	cout<<"  maximum possible interceptions: "<<maxLength<<endl;
	//cout<<endl;
}
/
int main(){
	TestingTheCatcher tc;
	int num=0;
	while(tc.readCase()){
		num++;
		tc.computing();
		if(num>1)
		   cout<<endl;
		cout<<"Test #"<<num<<":"<<endl;
		tc.outResult();
	}
 return 0;
}