POJ 1887 Testing the CATCHER.

POJ 1887 Testing the CATCHER.

~~~~

Find the longest ascending subsequence, and reverse the array. Isn't it the longest ascending subsequence? QAQ ..

 

~~~~

 

# Include

 
  
# Include

  
   
# Include

   
    
# Define N 10000 using namespace std; int f [N], a [N]; int main () {int t, c, T = 0; while (~ Scanf (% d, & t), t! =-1) {c = 0; a [c ++] = t; while (~ Scanf (% d, & t), t! =-1) a [c ++] = t; int I, j; for (I = 0, j = C-1; I

    
     
F [cnt]) f [++ cnt] = a [k]; else {int pos = lower_bound (f + 1, f + cnt, a [k])-f; f [pos] = a [k] ;}} printf (Test # % d:, ++ T); printf (maximum possible interceptions: % d, cnt );} return 0 ;}