Need Help in a problem on SPOJ.

Revision en1, by ayush_awasthi, 2015-06-04 23:17:58

I was trying to solve this problem on spoj http://www.spoj.com/problems/BOBERT/ can anybody please help me . Finding 20! arrangements and then a range minimum query would cause TLE so i dont know how to exactly approach the solution? I am looking for an initial approach and not the full solution.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English ayush_awasthi 2015-06-04 23:17:58 329 Initial revision (published)