PROBLEM LINK:Author: Hruday Pabbisetty DIFFICULTY:CAKEWALK PREREQUISITES:None PROBLEM:You're given $N$ sequence $A_1, \dots, A_N$, each containing $N$ elements. You should pick one element from each sequence (element picked from $A_i$ is $E_i$). $E_i$ should be strictly greater than $E_{i1}$. Your task is to compute maximum possible $E_1+E_2+\dots+E_N$ or output $1$ if it's impossible to pick such sequence. QUICK EXPLANATIONGreedily take maximum possible $E_i$ starting at $E_n$ and ending at $E_1$. EXPLANATION:Let's look at $E_N$. If there is element in $A_N$ greater than $E_N$ then we should pick it since it will not change that $E_i$ is increasing but it will increase the sum. So $E_N$ shoud be maximum possible element in $A_N$. Continuing by induction we can see that for $E_i$ we should pick largest possible element, i.e. $E_i$ is largest among all $A_i < E_{i+1}$. In this way one can solve problem in $O(N^2)$ by picking $E_i$ from $N^{th}$ to $1^{st}$ and finding largest acceptable $A_i$ each time. Example of solution:
AUTHOR'S AND TESTER'S SOLUTIONS:Author's solution can be found here. RELATED PROBLEMS:
This question is marked "community wiki".
asked 11 Jan '18, 01:43

We don't have a max function in c. So, what I did was sorted all the sequences in 2d array and proceeded. Yet somehow my solution showed runtime error. Here's my solution. Can you suggest possible changes. answered 21 Jan '18, 18:08
increase the size of array in n element size u r filling n+1 elemenets try quick sort rather than simple sort
(11 Feb '18, 00:45)

My solution received a score of 82. Though my approach might not be a efficient one, I would like to know the failing case. https://www.codechef.com/viewsolution/17017153 @admin @hruday968 @alex_2oo8: Any test case which you can provide? answered 10 Feb '18, 23:58

@admin provide testcases after the contest .. it would be good for us. if is very very very very hard to find just a small mistake there should not be any problem in providing test cases after the contest... bring some changes in your policy ... now answered 11 Feb '18, 00:35

@worldunique I have tested my code against the 3 test cases and it gives 1 for all. I have pasted my code below: using namespace std;
answered 11 Feb '18, 11:06
@ksanoop 1 5 5 5 5 5 5 5 5 5 5 5 24 45 85 69 58 6 6 6 6 666 88888 6 6 6 6 output on ideone is 89649 but it should be 1 the above is your code , just check it
(11 Feb '18, 15:03)

why this code is not working?it has no errors and it is giving correct answers..... include<stdio.h>int main() { long long int t,h,n,r,i,j,temp,sum,count;
} answered 30 Sep '18, 11:21

Can anybody help me? Why this code doesn't work? I tried all the possible cases I can think of
answered 02 Mar, 22:25
