MAXSUMSU - Maximum Subset Sum
It's not okay; got AC in 0.00s with bruteforce in slow language. This means people using this section for learning have no way of comparing algorithms, and worse still, might leave this one thinking O(n^3) is the bee's knees. This belongs to basics.
Weak test cases! Since it is a tutorial problem. It's okay.Last edit: 2017-08-15 09:33:11
Description gives : "All input fits in the integer size", but you should be more precise ; please give explicit bounds. Integer doesn't mean anything ; is it 32bit, 64bit, or ... ?