However, if you want a break or have other extra time when you can't do problems, reading through random algorithm articles in the locations listed above is a good way to expose you to some new ideas. But it is still more important to be actively solving problems when you can. Live Co...
When it happens, it's not possible to click on it to sort by rating asc. → Reply MikeMirzayanov 5 years ago, # ^ | ← Rev. 2 +29 Thanks, I'll fix it. UPD: Fixed it. → Reply Agnimandur 5 years ago, # | +21 ...And there go my dreams of ever solving a 2000...
The second seems to be a mix of greedy thinking (use big numbers to escape the sum range when you get to it) and a well known greedy problem (with numbers [1,x] you can always find a subset of sum for every value in [0, 1+2+3+...+x]). I've seen easier problems in div1...
Let's say you want to make it into this: +7 +5 +3 -3 -6 -6. The total sum will be 0, which is optimal. So I'm saying (though I have no proof for it) that you will be able to achieve in this way (highlighted in bold are the numbers which will be subtracted): 75 3 3...