### lucifer1004's blog

By lucifer1004, history, 5 weeks ago,

Hint
Solution
Code (Python 3)

Hint
Solution
Code (Python 3)

Hint
Solution
Code (Python 3)

Hint
Solution
Code (C++)

Hint
Solution
Code (C++)

Hint
Solution
Code (C++)

### 1437G - Death DBMS

Hint
Solution
Code (C++)

• +147

 » 5 weeks ago, # |   0 Auto comment: topic has been updated by lucifer1004 (previous revision, new revision, compare).
 » 5 weeks ago, # |   0 Nice job but can you tell me why time max = 2*n for question c ?
•  » » 5 weeks ago, # ^ |   0 Because $a[i]\leq n$, suppose that we put out the first oven at $t=n$, then the last oven can be put out at $t=2n-1$. We will never use $t>2n$ because we can always reduce the total unpleasant values by replacing it with a smaller time.
 » 5 weeks ago, # |   0 can you explain solution for C in more detail please.
 » 5 weeks ago, # |   0 Auto comment: topic has been updated by lucifer1004 (previous revision, new revision, compare).
 » 5 weeks ago, # |   0 thx a lot!
 » 5 weeks ago, # |   0 Auto comment: topic has been updated by lucifer1004 (previous revision, new revision, compare).
 » 5 weeks ago, # | ← Rev. 3 →   -14 Someone please tell me any good tutorial for graph theory I am a newbie and highly interested in graph theory, it would be great to start with some good tutorial.
 » 5 weeks ago, # | ← Rev. 8 →   0 Even A was not so easy for me, in contest I was analyzing cases obviously a should not belong to [l,r] i) if it is possible to have required a such that a>r, this gave me 2*l>r ii) then `a
 » 5 weeks ago, # |   0 Very nice and easy explanation! great work!! keep on doing this!
 » 5 weeks ago, # |   0 G is just a template problem if you use SAM.