Comments
0
On P_NyagolovDynamic Segment Trees, 10 years ago
0

can someone tell me why am i wrong?

http://ideone.com/BxPXmD

can someone good man explain me problem D more detail? i mean to tell me clear dp state

thanks for great explanation.

can someone explain more detail problem E?thanks.

On darkshadowsDP on Trees Tutorial, 10 years ago
0

in problem 2 why f[v]=1 when we have only 1 vertex?

is it can to solve qtree without hld? for example with centroid decomposition or some other technique?

in problem frank sinatra, can i quickly find minimal number,that is not present in given set.

can it gives me tle,if i can't use weight compress?

can someone explain problem E more clearly?,thanks.

On Arpa[Tutorial] Sack (dsu on tree), 10 years ago
0

can someone tell me how 208E is solved with this technique? thanks a lot.

can't understand why we ans+=cnt[prefix[x]^k] what gives me prefix[x]^k?

Ok