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...

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...

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

Zonal Computing Olympiad is round 1 out of 3 (i.e. beginner) for selection into Indian IOI team.

Zonal Computing Olympiad is round 1 out of 3 (i.e. beginner) for selection into Indian IOI team.

Zonal Computing Olympiad is round 1 out of 3 (i.e. beginner) for selection into Indian IOI team.

Zonal Computing Olympiad is round 1 out of 3 (i.e. beginner) for selection into Indian IOI team.

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?

Zonal Computing Olympiad is round 1 out of 3 (i.e. beginner) for selection into Indian IOI team.