..OvO..'s blog

By ..OvO.., history, 7 months ago, In English
Can somebody tell me how to solve 
these kind of problem using SEGMENT TREE

problem statement:

calculate the maximum sum of the element of the sequence such that 
the elements are in strictly decreasing order and first and last points
of the sequence are in it and the first point is always greater
than any other points in the sequence .

ex:   if the sequence it [30,27,24,15,17,10,12]

the answer will be 30+27+24+17+12
 
 
 
 
  • Vote: I like it
  • -25
  • Vote: I do not like it

»
7 months ago, # |
  Vote: I like it +3 Vote: I do not like it

and you thought just by writing a blog on codeforces you can get solution for this ongoing contest problem.

»
7 months ago, # |
  Vote: I like it 0 Vote: I do not like it

It's not even segment tree...

»
7 months ago, # |
  Vote: I like it 0 Vote: I do not like it

sharam kro bhai sharam kro

»
7 months ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it
Hint