Also it would be helpful if someone could help me figure out what is wrong with the following code for the above question as the code is not able to compute the answer when N=500 : [C++] Ajay Rajnikanh - Wealth Disparity
Read more… (42 words)
Active In
International Olympiad in Informatics
UI/UX Design
Startups
Game of Thrones
Artificial Intelligence
Virtual Reality
Music
Augmented Reality
Reading
Movies and TV Shows
Featured Contributions
NaN.
discussion
[INOI1601] Wealth Disparity (INOI 2016: India)
Problem in short: You are given a tree with N nodes, where each node i has a value v[i] associated with it. Find nodes i and j, such that i is an ancestor of j and (v[i] - v[j]) is maximized. N <= 10^5.
Indian National Olympiad in Informatics (INOI) is ro...
Read more…(69 words)
reply in this discussion
NaN.
discussion
[INOI1601] Wealth Disparity (INOI 2016: India)
Problem in short: You are given a tree with N nodes, where each node i has a value v[i] associated with it. Find nodes i and j, such that i is an ancestor of j and (v[i] - v[j]) is maximized. N <= 10^5.
Indian National Olympiad in Informatics (INOI) is ro...
Read more…(69 words)
reply in this discussion
Hi can someone help me, with what concepts I should learn to solve this problem?
Read more… (15 words)
NaN.
discussion
Four Sum (ZCO 2017: India)
Given an array of N integers and an integer T, find all possible combinations of indices i, j, k, l such that i < j < k < l and S[i] + S[j] + S[k] + S[l] is equal to T where S is the array of integers
Constraints: N <= 5000, T <= 10^6
Read more…(73 words)
reply in this discussion
NaN.
discussion
[ZCO16001] Bookshelves (ZCO 2016: India)
Zonal Computing Olympiad is round 1 out of 3 (i.e. beginner) for selection into Indian IOI team.
Read more…(17 words)
reply in this discussion
I think I have done the exact same thing i.e check the last book of a shelf and the first book of the other shelf and swap then K times and sort them each time you swap them
Read more… (38 words)
NaN.
discussion
[ZCO16001] Bookshelves (ZCO 2016: India)
Zonal Computing Olympiad is round 1 out of 3 (i.e. beginner) for selection into Indian IOI team.
Read more…(17 words)
reply in this discussion
The following code results in 4 WA and I don't know why can anyone help me with it? [C++] Ajay Rajnikanth - Bookshelves
Read more… (23 words)
NaN.
discussion
Matched Brackets 2 (ZCO 2012: India)
Zonal Computing Olympiad is round 1 out of 3 (i.e. beginner) for selection into Indian IOI team.
Read more…(17 words)
reply in this discussion
Can someone tell me what is wrong with the following code? [C++] Ajay Rajnikanth
Read more… (14 words)
NaN.
discussion
Break Up (ZCO 2015: India)
Zonal Computing Olympiad is round 1 out of 3 (i.e. beginner) for selection into Indian IOI team.
Read more…(17 words)
reply in this discussion
I feel that the second hint is a bit misleading as you say"map dp"and I went searching through the net to find out who you meant but then I realised what I had to do was not complicated at all.
Read more… (40 words)
NaN.
discussion
ZCO during exam
How many times are you allowed to submit a program? Will you be able to check if your program works for all the test cases and work on it again if it doesn't satisfy all the test cases?
Read more…(38 words)
reply in this discussion
NaN.
discussion
[ZCO14002] SUPW (ZCO 2014: India)
Zonal Computing Olympiad is round 1 out of 3 (i.e. beginner) for selection into Indian IOI team.
Read more…(17 words)
reply in this discussion
Thanks for your help.
The thing is i haven't learned these algorithms before, I just use whatever logic I think that will give me the answer, is that bad or is it okay to solve these problems without knowing its proper approach?
Read more… (42 words)