Tuenti Programming
Challenge 2

Go to tuenti

  Home  Info  Questions  Stats       

Challenge 3: The evil trader « Prev Next »

Completion time: min: 0:10 h
10 percentile: 0:40 h
90 percentile: 28:28 h
max: 114:19 h
Submit exec time: min: 2.35 s
10 percentile: 5.00 s
90 percentile: 773.00 s
max: 26571.76 s
Test tries: min: 1
10 percentile: 1
90 percentile: 20
max: 197
# of completions:282

You are a genius working for one of the most famous high-frequency trading firms in the world. But you are an evil genius and have found a backdoor that lets you add fake operations in the last second with all the daily stock information available. Having all the information, you can choose when to buy some shares and when to sell them and get maximum profit. Of course, you don't want to be greedy and draw attention to the operations and get caught, so you limit them to one buy and sell per day. Since it's a high-frequency trading system and you expect a big input, you design a program that reads all the stock information with 100ms resolution, gives the time when you want to add the buy and sell operations (in milliseconds) and tells you the expected gain. Of course, you want the maximum gain for that transaction.


One line with an integer for each stock sample.


The starting (when you buy) and ending (when you sell) point of the transaction in milliseconds and the expected gain.

Sample input


Sample output

400 700 29