CCO '03 P5 - Longest Substring - DMOJ: Modern Online Judge

CCO '03 P5 - Longest Substring

View as PDF

Submit solution

All submissions

Best submissions

Points: 7 (partial)

Time limit: 1.0s

Memory limit: 64M

Problem type

Canadian Computing Competition: 2003 Stage 2, Day 2, Problem 2

Within a sequence $S$ $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$ $S$ .

Input Specification

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

Output Specification

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

Sample Input

Copy

Sample Output

Copy

Comments

12

OneYearOld commented on Oct. 22, 2020, 11:26 p.m.

0 < |S| < 1131069.