Quantcast
Channel: CodeChef Discuss - latest questions
Viewing all articles
Browse latest Browse all 40121

LAZY PROPAGATION!!!(HORRIBLE SPOJ)

$
0
0

Was trying to solve http://www.spoj.com/problems/HORRIBLE/ with lazy propgation http://ideone.com/oSdgKp but could not get the logic of using the ""tree[node]+=val*(min(b,j)-max(a,i));"" as the code was copied..:P..or could any one plzz suggest how to solve this (i have an idea of out to solve with lazy propagation with still was unable to code..:()..


Viewing all articles
Browse latest Browse all 40121

Trending Articles



<script src="https://jsc.adskeeper.com/r/s/rssing.com.1596347.js" async> </script>