In the very best case, the team can get the penalty time as less as many penalty submissions it did (each one adds 20 minutes). "Dirty debug :(" message means that if the team had no penalty submissions at all, it would be the first rated. Another words, it would have the penalty time less than "QXX" has at the moment. Good luck!
SFMBE

I have 4 int vars, O(N) algo. I solved it 5 times already, and still (0.031,108). Useless.

Your understanding is right... But the discription of the problem is not clear enough. I really can't understand at first.

goood thing )

horrible code:

#pragma comment(linker,"/stack:3000000")
#include <iostream>
int X[10100],n,k,r,h=1e9,g,x,i,j,l;
int main(){
    if(!j)for(i=n;i;X[i--]=0);
    if(!l&!j)std::cin>>n>>k;
    if(l<k){
        std::cin>>x;
        for(i=x;i;r+=X[i],i-=i&-i);
        for(;x<=n;X[x]++,x+=x&-x);
        ++j==n?++l,(r<h?h=r,g=l:0),j=r=0:0;
        main();
    }
    else std::cout<<g;
}


Edited by author 10.04.2011 19:41

But why crash (stack_overflow)? My program shouldn't use so much memory!

[code deleted]

Edited by moderator 11.07.2006 23:07