HiCode2009's blog

By HiCode2009, history, 2 years ago, In English

https://codeforces.net/contest/4/submission/174376175

My code:Check if sumtime is in $$$[minsum,maxsum]$$$,minsum is the sum of all the $$$mintime$$$ and maxsum is the sum of all the $$$maxtime$$$.Then greedy for the solution.

  • Vote: I like it
  • 0
  • Vote: I do not like it

»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Not sure if greedy is applicable here, though I solved it with knapsack-like dp. Could you elaborate on your solution?

»
2 years ago, # |
  Vote: I like it +3 Vote: I do not like it

you are so close my guy. I took your code and only changed one thing. This is my submission: https://codeforces.net/contest/4/submission/178599913

can you spot what i noticed?

hint

`

second hint
third hint

hope this helps