Actually, it's not O(n)

as the size of the string gets larger so fast, it can reach 1e18, i.e. max K, within ~53 iteration, any farther computations are useless!

so I think that each query complexity is just O(min(log(k), n))

I solved it using Meet in the middle + Binary search

Split the n numbers to 2 sets, find all the possible subset sums for every set, that can be done in O(2^(N/2)) for each set

sort one of them and iterate over the other set, for every element, binary search for the value that gives the max value % m

How to solve Div 1 C ?

I can't understand why all those downvotes there is always a possiblity for such a situation and the testers & the problem setter described that they did their best. I think we can understand the situation more wisely ..

Delay, delay everywhere

THIS IS RIDICULOUS!!

Most contestants are complaining that problem A Div.1 is repeated with the same statement and the same author & problem B Div.1 can be googled easily and all we can get is IGNORANCE..

I downvoted the contest, it should be UNRATED!!

Div.1 A I wonder how many people could google this http://www.spoj.com/problems/TENNIS1/ during the round.... -_-

Actually, the national contest (ECPC) costs 75$ for participating only..

No accommodation nor transportation included!!

Will the editorials be published?

Dynamic Programming on prefix sum array

check this:

http://mirror.codeforces.com/contest/731/submission/21488865

Getting WA after about 45 minutes!! I only took a minute to debug my code ... of course not that long That really kills :v :3