Discussion @ 1247. Check a Sequence @ Timus Online Judge

Timus Online Judge

Online Judge	Problems	Authors	Online contests
About Online Judge Frequently asked questions Site news Webboard Links	Problem set Submit solution Judge status Guide	Register Update your info Authors ranklist	Current contest Scheduled contests Past contests Rules

Discussion of Problem 1247. Check a Sequence

Locomotive Hint 4 all.... you don`t need any array! just O(1*N)... [7] // Problem 1247. Check a Sequence 13 Mar 2003 11:35

Aidin_n7@hotmail.com

Popovich Antony I don't understand a problem [6] // Problem 1247. Check a Sequence 20 Mar 2003 03:49

I don't understand a problem

Why the answer to sample input 1 is "YES" ?
If we take i = 2 and j = 3, then
(3+0)<>(3-2+1)+3

ZhouWenzhe Re: I don't understand a problem [5] // Problem 1247. Check a Sequence 5 Apr 2003 14:38

(3+0)<=(3-2+1)+3

PTD_PDP O(n) [4] // Problem 1247. Check a Sequence 24 Oct 2004 16:01

Yes, just 373K and it's AC. Check that it's a sequence.

Beybut Re: O(n) [3] // Problem 1247. Check a Sequence 1 Mar 2007 15:15

manishmmulani Re: O(n) [2] // Problem 1247. Check a Sequence 2 Jan 2008 20:36

very nice problem !!!
jus a bit of thinking reqd

Piratek-(akaDK) Re: O(n) // Problem 1247. Check a Sequence 2 Aug 2008 19:32

Nice - i agree. For others only 10 strings - AC - 0.015

Piratek-(akaDK) Re: O(n) // Problem 1247. Check a Sequence 2 Aug 2008 19:32

Nice - i agree. For others only 10 strings - AC - 0.015