OJ Board

I got it...THX a lot

Adrian Kuegel wrote:It is possible to solve this problem in O(n).

Could anyone please give me more hint ?
I don't know how to do it in O(n)

THX a lot !!
I miss something

I have some suggestion to Administrator. First,I think there are some mistakes in ICPC archive account. Some of my friends register a new account on archive online judge. But they can't submit. I'm sure what they set in account are correct because it's the same as mine and I can submit code with my ...

I'm confused for the 3rd sample input
and it's output is 20

I don't know why and I think it should be 15.
because Why the answer is 20 ?

Hello everybody~

I'm trying to solve problem 10158 but always get TLE.

This problem should be about "disjiont set".
But it's like to think about so many conditions .

Could someone tell me how to solve this problem in detail ??

THX!!

Hello~everybody!!

I have submitted problem 737 - Gleaming the Cubes for several times but always got WA.

Could anyone give me some test i/o to help me find my mistake ??

Thanks a lot.