Hey My Quesiotn Is About Segment Tree.

I Already Read The source code for it From Comptetive Prog 3 But What I need to know is how to Do The Lazy Updating Or The Lazy Teqh.

Can Any One Give And Example So I Can UnderStand This Teqh Im Facing A Proplem With UnderStanding This Teqh.

And Another Thing Im Wondring If I Can Solve This Proplem Using Segment Tree

The Link : (http://mirror.codeforces.com/contest/283/problem/A);

My Submission : (http://mirror.codeforces.com/contest/283/submission/12340325)

Sorry For My Boor English . Have A Nice Day.