PEG Judge - CCC03 Stage 2 - Longest Substring

2003 Canadian Computing Competition, Stage 2

Day 2, Problem 2: Longest Substring

Within a sequence S of integers, find the longest contiguous subsequence that contains every integer at most once.
In other words, find the longest contiguous subsequence in which no integer is repeated. If there are several such subsequences, find the one that occurs first in S.

Input

The input will consist of the elements of S, one per line, in sequence, followed by 0.
Each element of S is a positive integer less than 65536. You should not assume anything about the length of S.

Output

The output should contain the correct subsequence of S, one element per line.

Sample Input

Sample Output

All Submissions
Best Solutions

Point Value: 20 (partial)
Time Limit: 2.00s
Memory Limit: 3M
Added: Dec 28, 2008

Languages Allowed:
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

Comments (Search)

_harun on Oct 02, 2015 - 7:19:23 am UTC RE

(0/0)

I am getting RE. I think it is for memory limit...
My code is taking 3.07M/3M.how can i reduce my memory ? . hint please :)

I am getting RE. I think it is for memory limit...
My code is taking 3.07M/3M.how can i reduce my memory ? . hint please :)

Bob on Sep 07, 2009 - 6:07:26 pm UTC Hints please?

(0/0)

bbi5291 on Sep 07, 2009 - 7:57:49 pm UTC Re: Hints please?

(1/0)

Try to avoid the linked lists please. They actually use [i]more[/i] memory than simple arrays, and are slower also. They will [i]not[/i] allow you to use more memory than you would otherwise be allowed.

All the AC solutions so far are in C++. C++ has a convenient function that allows you to "rewind" a file, that is, start reading from the beginning again. In Pascal on Linux the following should work:
[code]
assign(input,'/dev/stdin');
reset(input);
[/code]
After these lines have been executed, it should be possible to read the input over again. I leave it to you to determine how to use this knowledge.
[color=#FFFFFF][size=1]Unfortunately, Pascal does not allow you to seek to the beginning of text files such as input and output.[/size][/color]

Try to avoid the linked lists please. They actually use more memory than simple arrays, and are slower also. They will not allow you to use more memory than you would otherwise be allowed.

All the AC solutions so far are in C++. C++ has a convenient function that allows you to "rewind" a file, that is, start reading from the beginning again. In Pascal on Linux the following should work:

 
assign(input,'/dev/stdin'); 
reset(input);

After these lines have been executed, it should be possible to read the input over again. I leave it to you to determine how to use this knowledge.
Unfortunately, Pascal does not allow you to seek to the beginning of text files such as input and output.

jargon on Sep 05, 2009 - 5:56:40 pm UTC Invalid Return?

(0/0)

I've never had Invalid Return as a judge result before. What exactly does it mean?

I've never had Invalid Return as a judge result before. What exactly does it mean?

hansonw1 on Sep 05, 2009 - 6:30:36 pm UTC Re: Invalid Return?

(1/0)

Hmm.. ok. The detailed error should appear in your output now (the IR is basically a RE here)

Hmm.. ok. The detailed error should appear in your output now (the IR is basically a RE here)

bleung91 on Jan 20, 2009 - 3:54:09 am UTC time limit

(1/2)

why has the time limit on this problem been changed?

why has the time limit on this problem been changed?

hansonw1 on Jan 20, 2009 - 3:59:10 am UTC Re: time limit

(2/1)

It hasn't, I've added a tricky test case.

It hasn't, I've added a tricky test case.

hansonw1 on Dec 28, 2008 - 3:46:20 pm UTC Note

(3/1)

To make it challenging, the memory limit is very strict.
The input is [i]not[/i] guaranteed to fit in memory.

To make it challenging, the memory limit is very strict.
The input is not guaranteed to fit in memory.