Hello guys!

I'm solving a problem where I need to check if a graph can be split into a click set and a set independent. I would like to know if there is any algorithm or some technique to do this type of verification.

Problem

Tks :D

Hello guys,

The problem consists of a vector with size N (0 < N <1e6), a position i is chosen to determine how many elements are greater than the element v [i] in the interval [1, i -1]. In the problem there will be 1e6 queries. I would like to know how to solve this kind of problem with complexity close to O (log n) per query.

Sample:

1 7 4 5 6 7 8

Choosing the element in the 5th position (value 6) in the range [1, 5 — 1] there are 2 elements greater than 6.

Tks. :D

Hello people of Codeforces :)

I was solving a problem that had two types of operations: 1 — Insert element X the sequence 2- What is the kth largest element of the sequence. How to solve this type of problem?

The sequence may have 10 ^ 5 elements, and may have 10 ^ 5 queries.

Tks. :D