A party has been organised on cruise. The party is organised for a limited time(T). The number of guests entering (E[i]) and leaving (L[i]) the party at every hour is represented as elements of the array. The task is to find the maximum number of guests present on the cruise at any given instance within T hours.Example 1:Input :5    -> Value of T[7,0,5,1,3]  -> E[], Element of E[0] to E[N-1], where input each element is separated by new line [1,2,1,3,4]   -> L[], Element of L[0] to L[N-1], while input each element is separate by new line.Output :8     -> Maximum number of guests on cruise at an instance.Explanation:1st hour:Entry : 7 Exit: 1No. of guests on ship : 62nd hour :Entry : 0 Exit : 2No. of guests on ship : 6-2=4Hour 3:Entry: 5 Exit: 1No. of guests on ship : 4+5-1=8Hour 4:Entry : 1 Exit : 3No. of guests on ship : 8+1-3=6Hour 5:Entry : 3 Exit: 4No. of guests on ship: 6+3-4=5Hence, the maximum number of guests within 5 hours is 8.Example 2:Input:4  -> Value of T[3,5,2,0]   -> E[], Element of E[0] to E[N-1], where input each element is separated by new line.[0,2,4,4]    -> L[], Element of L[0] to L[N-1], while input each element in separated by new lineOutput:6Cruise at an instanceExplanation:Hour 1:Entry: 3 Exit: 0No. of guests on ship: 3Hour 2:Entry : 5 Exit : 2No. of guest on ship: 3+5-2=6Hour 3:Entry : 2 Exit: 4No. of guests on ship: 6+2-4= 4Hour 4:Entry: 0  Exit : 4No. of guests on ship : 4+0-4=0Hence, the maximum number of guests within 5 hours is 6.The input format for testingThe candidate has to write the code to accept 3 input.First input- Accept  value for number of T(Positive integer number)Second input- Accept T number of values, where each value is separated by a new line.Third input- Accept T number of values, where each value is separated by a new line.The output format for testingThe output should be a positive integer number or a message as given in the problem statement(Check the output in Example 1 and Example 2)

You have been given an array 'A' of N integers. You need to find the maximum value of j - i subjected to the constraint of A[i] <= A[j], where ‘i’ and ‘j’ are the indices of the array.For example :If 'A' = {3, 5, 4, 1}then the output will be 2.Maximum value occurs for the pair (3, 4)Detailed explanation ( Input/output format, Notes, Images )Constraints:1 <= T <= 1001 <= N <= 10 ^ 4-10 ^ 5 <= A[i] <= 10 ^ 5Time limit: 1 sec.Sample Input 1:1934 8 10 3 2 80 30 33 1Sample Output 1:6Explanation:Maximum value occurs for the pair (8, 33)Sample Input 2:1109 2 3 4 5 6 7 8 18 0Sample Output 2:8Explanation:Maximum value occurs for the pair (9, 18)

Say you have an array, A, for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most 2 transactions.Return the maximum possible profit.Note: You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).Problem Constraints1 <= length(A) <= 7e51 <= A[i] <= 1e7Sample input57 2 4 8 7Sample output6

Find the maximum element from the given array of integers.

Max AltitudeImagine a pilot starting the flight from the ground and flying over a series of different points at different heights. You are given an array, where A[i] represents heights.Currently, if the pilot is at altitude X at ith point, and if he wants to reach (i+1)th point, his altitude will become X+A[i].The pilot starts at altitude 0 and wants to find the highest point he can reach during the entire journey. Your task is to print the highest altitude the pilot reaches.Input FormatThe first line of input contains an integer N. The second line of input contains N space-separated integers.Output FormatPrint the highest altitude the pilot can reach.Constraints1 <= N <= 1000-1000 <= A[i] <= 1000ExampleInput5-5 1 5 0 -7Output1ExplanationWhen the pilot started at point 0 his altitude was -5, when he moved to point 1 his altitude became (-5 + 1 = -4), at point 2 his altitude became(-4 + 5 = 1), at point 3his became altitude remains(1 + 0 = 1), and at point 4 his altitude became (1 + -7 = -6). The maximum altitude that he reached in his journey was 1.

You have n𝑛 chocolates. You can perform the following operation each day as long as you have at least one chocolate:Choose any p𝑝 people from an infinite number of people (1≤p≤current amount of chocolates)(1≤𝑝≤current amount of chocolates).While you have at least p chocolates:Give exactly one chocolate to each of p𝑝 person.Move to the next day with the remaining chocolates.It is not necessary to select the same p𝑝 each day. Your task is to determine the maximum number of days you can perform the above operation.InputThe first line contains a single integer t𝑡 (1≤t≤105)(1≤𝑡≤105) — the number of test cases.The first line of each test case contains a single integers n𝑛 (1≤n≤1018)(1≤𝑛≤1018)  — described in the statement. OutputFor each test case, print a single integer — described in the statement.