Very strange. Anybody has a similar problem?

I had that problem too. But when I opened that file with 7zip, it has been opened normally.

Consider a set of points (l, r) on plane such that 0 ≤ l ≤ r ≤ n - 1 where the point (l, r) corresponds to a segment [l, r].

Consider some number x and all its occurrences. Suppose that the number x is one of the numbers that make some particular segment [l, r] be bad. Then one of the following situations should happen: either there are from 1 to x - 1 or more than x + 1 occurrences of x in [l, r]. That means that for the fixed l there are two segments of banned values for r. Actually, for any possible l lying between two consectuvie x's, those two banned segments for r will be the same. It can be reformulated that there are O(c_x) banned rectangles on a plane that point (l, r) isn't allowed to be in, where c_x is the number of occurrences of x.

Construct all such rectangles for all numbers x, there will be O(n) of them in total, and then calculate the number of points that do not lie in any banned rectangle in via sweeping line.

Although this solution has better time complexity, there are solutions that work even faster because they do not utilize much memory and use only simple operations.

Code for reference:

solution by me: http://pastebin.com/k0GHWxuQ

solution by Errichto: http://pastebin.com/UXziv4iD

The download link doesn't work for me, can you share the problem statements somewhere else?

Программа расчитана на 7 дней http://izho.kz/index.php/ct-menu-item-15/ct-menu-item-17 Но в этом году соревнование ( по программированию ) было два дня подряд по 5 часов и было 3 задачи. У задач были подзадачи и при прохождении всех тестов подзадачи Вам начислялись баллы этой подзадачи ( ну как в заочке ).