Please enter your email address or userHandle.
The cost of stock on each day is given in an array A of size N. Find all the days on which you buy and sell the stock so that in between those days your profit is maximum.
First line contains number of test cases T. First line of each test case contains an integer value N denoting the number of days, followed by an array of stock prices of N days.
For each testcase, output all the days with profit in a single line. And if there is no profit then print "No Profit".
1 <= T <= 100
2 <= N <= 103
0 <= Ai <= 104
100 180 260 310 40 535 695
100 50 30 20
23 13 25 29 33 19 34 45 65 67
(0 3) (4 6)
(1 4) (5 9)
Testcase 1: We can buy stock on day 0, and sell it on 3rd day, which will give us maximum profit.
Note: Output format is as follows - (buy_day sell_day) (buy_day sell_day)
For each input, output should be in a single line.
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.