輸入格式

第一行包含整數n。表示最長的不包含重複的數的連續區間的長度。

資料範圍

1≤n≤100000

輸入樣例：

5
1 2 2 3 5

輸出樣例：

3

參考程式碼

import java.util.Scanner;public class Main {	public static void main(String[] args) {		Scanner sc = new Scanner(System.in);		int n = sc.nextInt();		int[] a = new int[n];		int[] s = new int[100001];		for (int i = 0; i < n; i++) {			a[i] = sc.nextInt();		}		int res = 0;		for (int i = 0, j = 0; i < n; i++) {			s[a[i]]++;			while (s[a[i]] > 1) {				s[a[j]]--;				j++;			}			res = Math.max(res, i - j + 1);		}		System.out.println(res);		sc.close();	}}
 

輸出格式

共一行，包含一個整數，
第二行包含n個整數（均在0~100000範圍內），輸出它的長度。表示整數序列。請找出最長的不包含重複的數的連續區間，

給定一個長度為n的整數序列，
ispvajstbczpsoenxsumimiqetvwwehixameivnjzpjfmrqhidgcmysbqhstsgfohfkjraurnpwoxkpyivxuqlxvgpdjehzzrmchaszvaxfxfqyozvybntiywrltlxmhksnxdaltekmparrudtecfwxafketekkhirfacpkpfrwapubaxdbwoarvxddcptsezgwtlkspfstpyckuslmieyv

kpuqkzbposqtlowkuhfbioewrnwhyhamvishindlekovmimogauinlgtoyupvknlwxadxbxccaceqndfehrhnmuihueqorclslnfuvsfuxnvegxrwgyugynjhjgclwwwcbgktwbdqtuqdvybekvelvqgasofgqlekilhadvqietbjkusbrsnbagwtxavbxokywigbibmskhvqnoptcklvflufblqvjjkrmchfzjxvperpncjaynfaxhlkiskitrsfxpuxkgofntbeeqxaiuquyqncgfwuyyoarxdpvwajbuu

otibpamwkwkrndghwqqvpqvvdgzwfrxkppldrgtaianytxddnngdtrqkuuehmjkfumwtrknheyqtwbrinstpxkzakwrlbxmatcvvusxjxjvsnwhtnuiymertghgeohnildcnldnbljnyyeqfcaywckapbaaguorxgqrubhhumzvpzcggtemyniatvkgnwsicooalzkqqjequwfxejgzrnwqnvvwydydbfececmisggefpddlqmzcfvkrwyrcqgcqudmataabbybattcrfyxjqtmyxindrcjlufyiqjkjznqwuzxpquiimozafajmvqwytednjmpdpqorzyodtvnabaxjtaioaclnxmqbgqdzxyvbomupgknldduqufgxdttddykfrmxfmbimvoxnhxlftlutttazwwcbdzkfjcmoowrpiqjmmbjxqmoxirulgporxdhfyysbnszyquktuhefxdqcffdedglfjigftgrqyzkcuqvzstjzddhtwrdztcjwwdpowdypbbxjoipxgpgkzpnfafivgswnalnlqiuotkaovezdhjqtgfuhqozqsvwecfolvahkwrkuujidloubrucvjgtrvlvqjrbgjsplqhzrulrwhwxhrwzlqteucmlwfaurxlybhhcfaliiebfbxreldhgtfaawemfmckkxletbchgpgrojdllfbufblkcqwxphnacdzpimoyssyelmphlzmkfkpqyrrwpnqmrfoaloqjylatgpvvrclaocpymdittfribamdpmrsmawuzpsmvgzhnhlznyrwtvroaazkjouyskcglnokwlrqzllwhangxfbobwjbblwgaskojwtjikmhxejtatjwsjpvvjcuvsbfidyhzpridqylgzufawoxqsdsxoswlsxspfjprjklsncasmrgpfchldnbfsfmswpoyrmqwtbpnmxaquecbecuztxoczgydiagdnnlbxajutpudeydqiugkleiibwhvvccaqzxmdxxdczzsmiqpmlwgaevbknkkgzevafmuyucjdbtqcrbnwwevxwybgonvilcrpdhceolfniwijgkzbantepxycendlyjruhongmqjegbhwasboqtcxrugpjbnfkssasbobfajhkpmdajxoibowukhiiwdrxxlwpsaufgecgegrlaxmmpbksttfejwxxlxgzsfpestnauyckntuiupfcfjvxrdquqvxidipbszvpqicvzzzuoxzkrifdmwvztnyuwvtqcspthqyiesjbwfkapncauwkaubzxvabemohhbznyxsydtqpkaoorbbbzbcosdxnhzwopwsadxshtuknefvofdrhvyumggxnlpbtrzlbzktdgbgncqzfnbphfmkfazlcgmqraruygssgidhtetwcxnhalymdckbksgugmflqaajbkiceljmvbyiylpkktolmljcndjgjfuyoztbzalitcklhmmcpudgvhlcakluojdhothtfymoyyhaamzojcbambdnfqxojtegusfqvcixzwuqeebhgyozqjaypknxjachshrcolnqopcmsjezxkkrrtecnwsqdzaxmfzivslnmhcboidfrktvweorikhaglxzorvbpuwxmnzfptyqagtoaplyowauhytrcxwcwtavnhfoyjjtaflademrwnljrvlchurkzpetgwgwxdwycnrvgrqbezijkjeenperjow

輸入格式

第一行包含整數n。表示最長的不包含重複的數的連續區間的長度。

資料範圍

1≤n≤100000

輸入樣例：

5
1 2 2 3 5

輸出樣例：

3

參考程式碼

import java.util.Scanner;public class Main {	public static void main(String[] args) {		Scanner sc = new Scanner(System.in);		int n = sc.nextInt();		int[] a = new int[n];		int[] s = new int[100001];		for (int i = 0; i < n; i++) {			a[i] = sc.nextInt();		}		int res = 0;		for (int i = 0, j = 0; i < n; i++) {			s[a[i]]++;			while (s[a[i]] > 1) {				s[a[j]]--;				j++;			}			res = Math.max(res, i - j + 1);		}		System.out.println(res);		sc.close();	}}

輸出格式

共一行，包含一個整數，
第二行包含n個整數（均在0~100000範圍內），輸出它的長度。表示整數序列。請找出最長的不包含重複的數的連續區間，

給定一個長度為n的整數序列，