STL:

yes it will. I previously used to code in JAVA. But in IOITC You will face LOT of problems with it. So shift to C++.

Mainly because java is slow.. so even o(n) solutions cause TLE.(happened with me)

Reply , extremely sorry.. my bad.

This is a simple problem per se,using a merge sort tree should be enough.

I hope this is correct.

So, we just make a struct for every element, like this :

struct element {
     int x;
     bool marked;
}

The purpose of the 'marked' variable I will explain later.

Now, we create an array of this struct. This represents our original array.

Now, we need two data structures, one segment tree and a vector.

So, after every operation, we visit the Yi and mark the x variable to Xi.We also set 'marked' = true for that. Now, if there was a data structure where we could access the elements in constant/logarithmic time and also remove and add the elements in constant/logarithmic time, we could have just removed that element and added it to...

This seems to be a correct solution, but since I have not submitted it yet, I will not give it in the form of hints. If you guys think it is correct, then I will edit it (or if I submit it and get AC).

First, we will build a prefix array for the number of occurences of that character till that index, for each of the characters, which will thus form a 2D n*26 array.

Observe that each row will be sorted. We will later use this.

Now, we handle each of the queries separately.

For each query, iterate through all the indices. For each index i, calculate the position of the first index j such that j<i and val[i]-t >= val[j]. Do this using binary search or a kind of two pointer.We have to do this for all the characters and store them in an array or list. Basically, this means that if for 'a' , j was 12 and i was 36, any substring ending at i and starting at or before j...

Hi, I may be able to help.

For Java vs C++ ,

It is much shorter to write code in C++ ( not necessarily easier) than in Java. Also , the vector class is very useful. STL is also very useful. But, for IOI, I personally think that Java is better for multiple reasons :(although I may be a bit biased, I have coded in both Java and C++ :) )

It is a bit more strictly typed language than C++ and the syntax makes sure that you don't make some errors that may occur in C++, like variable init with garbage value. It's library is much more vast.Also, you don't have to worry about memory and call-by-value etc. Then, with the thorough exception handling features of Java, it is a easier to debug your code in general. Another thing, though not much of an advantage, is the presence of the BigInteger class, which may come in handy sometimes. Now, I believe that in IOI style contests, coding speed in a language should not cause that much of a problem. Als...

I would like to know some tutorials for digitDP techniques, could someone post some online tutorials.

I think that you will need a self-balancing BST with some augmentation like keeping track of number of nodes in subtree.

Here, deletion will be logarithmic , as well as getting the n'th element, which you can figure out yourself on how to do.It is quite easy.

I am currently in class 9. I started programming in class 7 (around end of 2014) and wrote my first game in QB64 : a ping pong. In the next six to seven months, I made three or four more games including standard ones too like snake and PacMan. Then I learnt Java in class 8 and after learning OOP for 3-4 months started my first game, which was not that great.Currently I am making a graphical roguelike, which has quite a lot of features already(been developing it since last May, although there have been some gaps due to school exams and preparing for olympiads.

Lately I have been studying opengl. I mostly code in Java now as (I think) my OOP skills are quite good, and I know quite a bit about Java(did Oracle certification 7-8 months back.).

All the better games are there on my blog : https://programmingwithrajarshi.blogspot.com

except this last one, as the character images I use are not created by me, but taken from elsewhere.I am not great at art, so unless I make some character spritesheets, I will not post it online.