CommonLounge is a community of learners who learn together. Get started with the featured resources above, ask questions and discuss related stuff with everyone.

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 round 2 out of 3 (i.e. intermediate) for selection into Indian IOI team.

Problem in short: You are given an array a of length N. You start at position k. In the forward phase, you make jumps of size 1 or 2 towards the right. Then in the backward phase, you make jumps of size 1 of 2 towards the left till you reach position 1. Your score is the sum of the values in the array where you landed after each jump. What is the maximum score you can make?

Indian National Olympiad in Informatics (INOI) is round 2 out of 3 (i.e. intermediate) for selection into Indian IOI team.

Problem in short: There are N people, and person i takes a[i], b[i] and c[i] time to do task a, b, c respectively. Only one person can do task a at a given point of time, and each person must do tasks a, b, c in-order. In which order should the N people do task a, so as to minimize the time at which everyone is done with all of their tasks. N <= 2 * 10^5.

Indian National Olympiad in Informatics (INOI) is round 2 out of 3 (i.e. intermediate) for selection into Indian IOI team.