Right. Also you may read Wikipedia about ACM-ICPC.

Зато некоторым (и мне в том числе) не придется просыпаться в 2 часа ночи. Не все же в одном часовом поясе. Хотя, конечно, неудобно, если раунд совпадает с каким-нибудь экзаменом, пусть даже и пробным.

Условия будут на русском и английском языках, и участвовать необходимо индивидуально. Очевидно же, блин...

Вроде как да — 22.04.2012 11:00 "GP of SPb"

UPD Не будет

Да, спасибо. Обновление откладывается, надо исправить.

нет

Are you sure?But the tag now is "two points".

Binary search is one of the intuitive method to solve the problem. You didn't use it doesn't mean it's wrong.

This problem can solve by DP sliding window too.. :)

А еще задача C не так давно была на нашей тренировке, правда, с меньшими ограничениями.

Кстати, нашел баг, пока что не нарисовали табличку и не поменяли рейтинг, но у меня, и у zakharvoit изменился цвет, хотя в комментариях отображается нормально.

Там можно было за квадрат решать.

It shouldn't be. Admins should take a look at that. If you dig a bit deeper you might notice that the people placed #7, #11, #12, #14, #18, #19 have matching solutions (at least for some problems). They all come from the same city, so I suppose they participated together.

In general: I have no problem with people joining the contest together (not sure if that would be against the rules) but simply copying solutions is very dishonest towards all other contestants. I don't even see the purpose of cheating here. Do people get an ego boost if they get an increased rating based on somebody else's solution they submitted?

I think both VNBZTY and Liu_Ts are the same people..They submitted the same codes to all the problems(even the variable names and their initial values are same) , solved each problem in exactly the same language and always VNBZTY submitted the code and if it was accepted then within 10 minutes Liu_Ts submitted it...So much cannot be mere coincidence. Take a look at their submissions and compare it ..VNBZTY submissions , Liu_Ts submissions

Administrator will accept it to first user after finishing contest but in it contest it will accept to both users.

так и не удалили(

After publishing editorial author's usually put the link in the blog page. For some strange reason codeforces is not interested to put links of all editorials on a single page,so iman_MC made this page: http://codeforces.me/blog/entry/1492, here you can find editorials of previous rounds.

UPD == UPDate

UPD = Update

So here is a simple solution: I maintained an array of vectors vector arr[] where arr[i] contained the array of different paints between any two consecutive i. Therefore arr[i] would be empty if the string had no or just one element of the type. If inp= 1 2 3 1 2 3 5 1 1 then arr[1]= 2 3 0 Then, I iterated through all the array of vectors to find the maximum number of consecutive elements that sum to <=k. This is the code for the later part

for(int i=1;i<100001;i++)
  {
    if(v[i].size()==0)continue;
    int back=0;
    int front=0;
    int sum=0;
    bool frontmoved=true;
    bool backmoved=false;
    while(front!=v[i].size())
    {
      if(frontmoved)
	sum+=v[i][front];
      if(backmoved)
	sum-=v[i][back-1];
      if(sum<=k)
      {
	if(max<front-back+2)max=front-back+2;
	front++;
	frontmoved=true;
	backmoved=false;
      }
      else
      {back++;backmoved=true;frontmoved=false;}
      if(front<back)
      {front++;frontmoved=true;}
    }
  }  

может из-за того, что для решения этой задачи знать что такое граф не обязательно?

Be patient, maybe they ( or the server) are busy now. The main reason you are here because you want to practice more, not to get high score to be contemplated :)