Hello everyone,

I was trying to solve INOI 2019 Problem 2 - Interesting Sequences. I have tried the DP solution.

My approach -

1) Sort array and check for elements with same values and store the maximum answer possible.

2) LIS type DP to check the maximum answer.

3) Print the maximum of answers obtained from 1 and 2.

My approach is giving WA. I have tried to understand other's solutions and I have noticed they are something like binary search + DP. I cant understand it. Please help.

Here is the link to the problem - https://www.codechef.com/INOIPRAC/problems/INOI1902

This discussion is for expanding your array of maneuvers needed to code quickly and efficiently.

STL:

The first and most important thing that I'd like to discuss about is the C++ STL. Learning it would enable you to code up an assortment of algorithms and complicated data structures in a matter of seconds.

You can learn to use the C++ STL from the following amazing sites:

Studytonight : Contains syntax and examples for most of the STL containers and algorithms.

Sanfoundry : Shows how to implement what you've learnt in complete programs

Topcoder(Highly recommended) : This place teaches yo...

The problems from https://opc.iarcs.org.in/ have been moved to https://www.codechef.com/IARCSJUD. The problems which were supposed to accept multiple solutions now have new checkers, and some wrong data has been fixed. So everything should hopefully be fine now. If you notice any issues please comment in the respective problem page.

Here's the thing, I messed up my ZCO and is getting 0.

ZIO is my last shot as I am in 12th, and when I sat down to solve ZIO qpaper 2013, I was stumped by the very first question.

So, how do you come to an algorithm for problems in ZIO and what all can be done in 5 days.