Suppose you have two operations : 1 ADD L R x, add from L to R value x 2 SUM L R, get the sum from L to R.
How can you implement these using any typical BST like treap or splay tree?
Suppose you have two operations : 1 ADD L R x, add from L to R value x 2 SUM L R, get the sum from L to R.
How can you implement these using any typical BST like treap or splay tree?
Can anyone share a method or an idea to find lexicographically smallest minimum cut in a graph.
http://codeforces.com/contest/136/submission/3133932
It outputs 10 on my pc but judge says it outputs 0, for the 2nd test case.
Any help?