Discussion @ 1273. Tie @ Timus Online Judge

Subject	Author	Problem	Updated	Answers
DP can AC in O(n^2)......but waht algo can AC in O(nlogn)?	Yu YuanMing	1273. Tie	11 May 2011 21:39	1
WA#1	kirill_SSAU619	1273. Tie	31 Oct 2010 14:25	0
If you have WA#3	Aleksander	1273. Tie	1 Apr 2010 22:59	1
test	Alexander Akimenko ssau 6108	1273. Tie	23 Mar 2010 20:21	1
wa7	nick's_name	1273. Tie	4 Oct 2009 16:21	0
how can it be solved for nlogn?	Лелик	1273. Tie	29 Aug 2009 15:50	4
I think K is too small	Gheorghe Stefan	1273. Tie	29 Aug 2009 15:38	5
Please help anybody(What a ucking tests are there??)	Emil	1273. Tie	1 Mar 2008 00:13	0
How accepted 1273???	Lepilin Max SSAU 619	1273. Tie	15 Jan 2008 19:16	0
Need tests! It brakes on 7-th test!	UMC (SSAU)	1273. Tie	3 Dec 2007 19:35	0
why wa on test#7? Help	LeXuS[Alex Kalugin]	1273. Tie	3 Dec 2007 19:32	7
Problem 1273 "Tie" has been rejudged (+)	Sandro (USU)	1273. Tie	12 Dec 2006 01:33	1
WA#9	Trần Quang Chung	1273. Tie	10 Jun 2006 21:53	0
I didn't expect me to be so stupid! I even don't know how to organize DP!	Alexey	1273. Tie	10 Jun 2006 17:30	0
(wa5) give me wrong test. PLEASE.	Виктор Крупко	1273. Tie	21 Aug 2005 21:39	5
What the heck is wrong with this stupid problem?	Jiang Xu	1273. Tie	11 Aug 2005 00:02	4
Who can give me some GOOD tests I got Wa7! I thinck my program GOOG! but Wa7	Нищий Наглец	1273. Tie	29 Jul 2005 04:34	0
I got AC	Тёма и Серёжа	1273. Tie	14 May 2005 16:09	1
How did you do it in O(n^2). I only know n^3 =(	hey, dude!	1273. Tie	4 Apr 2005 16:55	1
And what about this test?	Sandro	1273. Tie	3 Feb 2005 11:27	4

Style: flat | tree | nested
Thread Order: bubble | fixed

Discussion of Problem 1273. Tie