November Lunchtime Editorials

editorial
, , , , ,
52

That thing was hard af to debug. I cant believe I missed that. set lowerbound and normal lowerbound. The more you know about STL XD

53

@vijju123 It took me 2 hours of thinking and googling to find it out. Glad to share it with others, and spare their time :stuck_out_tongue:

@taran_1407 There wasn’t too much messing

54

@vijju123 - Sorry xD i will try to put more readable code with some documentation before asking for help next time. Thank you for your efforts! and thanks bazsi once more.

55

@mgch can you please elaborate 2nd observation a little more?

56

Did you read @mgch 's answer?

57

@vijju123 which one?

58

@pk301, how did you solve it?

59

@vijju123, pleaseeee have a look at the formatting of LRQUER editorial… I tried to use latex feature, but couldn’t…

Help!!

60

@skpro19 i didn’t able to solve it for 100 but with a dp approach i get 27

61

@skpro19 if you get the logic then please explain it. it will be a great help :slight_smile:

62

@taran_1407 please elaborate the observation 2 in the last question!

63

@pk301, i have added an explanation in answers.

1 Like
64

@pk301, are you on codeforces?

65

@taran_1407 thanks a lot!

one more thing please…it is written : “(min and max on the segment in the segment tree, dp[2][2], dp[2][2] and other things)”. What is the need to store min and max? We can calculate dp values by hand at base level and thus can combine them to get answrs for higher level. so, what is the need for them?

and last thing i have understood how to add elements(just add a node at last) but how to support erase operations? is min and max is something that requires for this one?

66

Mate, i haven’t myself implemented the solution yet. I knew about 2nd observation, so i wrote the proof here…

67

okay thanks taran but one request if you implement it in future please provide the solution link.

68

@skpro19 yes!

69

If i implement, i will post solution link.

70

@pk301 username?

71

@skpro19 pk845