links
Saturday, 12 September 2015
inversion count to do
segment tree to do
http://codeforces.com/problemset/problem/61/E
http://acm.timus.ru/problem.aspx?space=1&num=1523
http://www.spoj.com/problems/INCSEQ/ /* dp+segtree**/ this problem cal solve both upper problem
Newer Posts
Home
Subscribe to:
Comments (Atom)