ACMCEG2C  Pick the candies
Pick the Candies
Many children went to a sweet shop. There were n candy varieties and each variety is kept in a separate bowl. The sweetness of each variety is written on the bowl. All the children wanted the candy with highest sweetness value. As there are only limited candies in each variety, the shop keeper makes a rule. According to the rule, the shopkeeper will show selectively chosen k varieties to every children. The children can pick any one of those varieties and move away. To make it easy for him, the shop keeper shows the
varieties 1,2,...,k to children1,
varieties 2,3,…,k+1 to children2,
varieties 3,4,…,k+2 to children3 and so on..
All the children are good at math. Find what variety each child will choose.
Hint: use deque
hide comments
cegprakash:
20170227 11:13:09
omg Shakir 

S. M. Shakir Ahsan Romeo:
20170212 21:14:13
Solved by segment tree :P 

Glenda Emanuella Sutanto:
20160911 09:39:12
@sharif ullah :


sharif ullah:
20150525 11:45:51
i cannot understand the problem statement .even the inputs 

dabuu:
20140719 06:39:52
why i m getting WA in 3 test case ? Please Check 

lavish goel:
20121217 10:56:16
Ok I got it sorry :):) 

lavish goel:
20121217 10:53:24
How many children are there? :(:(

Added by:  cegprakash 
Date:  20120330 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: BF GOSU 