A.Kaan37's blog

By A.Kaan37, history, 9 months ago, In English,

In 09.03.2019 there will be COCI exam in this link: http://hsin.hr/coci/ You can study for the old COCI's here: https://oj.uz/problems/source/122 Also this site has an online judge. The contest will begin at:09.03.2019 14:00 GMT/UTC and it will take three hours.

UPD1: Last 4 hours...

 
 
 
 
  • Vote: I like it
  • +67
  • Vote: I do not like it

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

Thank you for announcement.

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

Auto comment: topic has been updated by A.Kaan37 (previous revision, new revision, compare).

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

Last 3 days.

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

Auto comment: topic has been updated by A.Kaan37 (previous revision, new revision, compare).

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

Let me give Sličice's solution. You will do dp for this question.You will keep two things in recursive.(Index and how many bonus you have)

Then you use for in recursive for how many times you use bonus for this index . Then you will take max.

This is the code: https://paste.ubuntu.com/p/twNKyCZBjS/