Thanks sir for reply i am trying and willing to improve with your guidance.
but the major problem i was getting was thinking why the two sequences increasing and decreasing marked by i and j .wont have a common element which has not to be counted for twice by the method?
Indian National Olympiad in Informatics (INOI) is round 2 out of 3 (i.e. intermediate) for selection into Indian IOI team.
Sir your hints are not clear can you give some more vivid description how to compute dp[i][j] in O(1) what is the dp formulae how aree we starting or recurrssingg upon what ensures our increasing or decresing sequences do not clash
@Garret Irwin @Keshav Dhandhani
Problem in short: In a grid of size R x C, you need to find the number of paths from the top-left to the bottom-right. You may only move 1 block to the right or one block down in each step. Yo...
If anyone has problem solving this question refer this link for explanation
Problem in short: In a grid of size R x C, you need to find the number of paths from the top-left to the bottom-right. You may only move 1 block to the right or one block down in each step. Yo...
@Keshav Dhandhani
If anyone has passed all the test cases
Can anyone share their code and note their submission on codechef
because (Its not accessible to other users ).You can submit it on ideone.com and share the code .Thanks in advance.
Problem in short: We are given N pairs and from each pair we have to choose one element such that the difference between chosen sum and not chosen sum is minimized. N <= 150, value of elements <= 300.
Can you tell why the greedy solution "sorting pairs in the dec order of difference b/w book values in a pair and then keeping the two scores almost near " does not work ???
Notes: This problem needs input-output optimization to run in time. If you are using C++ and you use cin to get your input, add these two lines to the beginning of the main function. You don't need to do anything if you use scanf.
ios_base::sync_with_stdio(false);
use either scanf printf for fast io or add these two lines at the beginning of your code just after int main{ for fast i/o .
ios_base::sync_with_stdio(false);cin.tie(NULL);
To understand what they do .See this one
