## Editorial for Dãy số

Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

Lưu ý: Các code mẫu dưới đây chỉ mang tính tham khảo và có thể không AC được bài tập này

#### Code mẫu của flashmt

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int inA[100100], inB[100100], c[100100], cnt[100100];

int main()
{
int x, m, p, n, ans = 0;
cin >> n >> m >> p;

int nn = 0;
while (n--) cin >> x, nn += !inA[x]++;
n = nn;

while (m--) cin >> x, inB[x] = 1;

for (int i = 0, j = 0, distinct = 0; i < p; i++)
{
cin >> c[i];
if (inB[c[i]])
{
while (j < i) cnt[c[j++]]--;
distinct = 0;
j = i + 1;
}
else
{
if (!cnt[c[i]]++ && inA[c[i]]) distinct++;
if (distinct == n) ans = max(ans, i - j + 1);
}
}

cout << ans << endl;
}


#### Code mẫu của happyboy99x

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <numeric>
#include <climits>
#include <utility>
#include <bitset>
#include <cfloat>
#include <cctype>
#include <complex>
#include <deque>
#include <sstream>
using namespace std;

typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef vector<int> vi;
typedef vector<vi> vvi;

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define TR(v,it) for( typeof((v).begin()) it = (v).begin(), _e = (v).end(); it != _e; ++it)
#define REP(i,n) for( int i = 0, _n = (n); i < _n; ++i )
#define FOR(i,a,b) for( int i = (a), _b = (b); i <= _b; ++i )
#define REPD(i,n) for( int i = (n)-1; i>=0; --i )
#define FORD(i,a,b) for( int i = (a), _b = (b); i >= _b; --i )

#define INF 1000000000
#define N 100005
/*--------------------------------------------------------------------------------------------------------------------------------------*/

int n, m, p, c[N];
bool ma[N], mc[N], mb[N];

int main() {
//    freopen( "SEARCH.INP", "r", stdin );
//    freopen( "SEARCH.OUT", "w", stdout );
scanf( "%d%d%d", &n, &m, &p );
int t, N_ = 0;
REP(i, n) {
scanf( "%d", &t );
if(!ma[t]) ++N_;
ma[t] = true;
}
REP(i, m) {
scanf( "%d", &t );
mb[t] = true;
}
REP(i, p) scanf( "%d", c+i );
int len = 0, maxlen = -1, cnt = 0, st = 0;
REP(i, p) {
if( mb[c[i]] ) {
if( cnt == N_ && len > maxlen ) maxlen = len;
len = 0; cnt = 0;
FOR(k, st, i) mc[c[k]] = 0; st = i + 1;
} else {
++len;
if(ma[c[i]] && !mc[c[i]]) ++cnt;
mc[c[i]] = 1;
}
}
if( cnt == N_ && len > maxlen ) maxlen = len;
printf( "%d\n", maxlen );
return 0;
}


#include <iostream>
#include <cstdio>

const int N = 200005;
using namespace std;
int m, n, p;
int a[N], b[N], c[N];
bool inA[N], inB[N], chk[N];

int main() {
scanf("%d %d %d", &m, &n, &p);
int cnt = 0;
for(int i = 1; i <= m; i++) {
scanf("%d", a + i);
if (!inA[a[i]]) cnt++;
inA[a[i]] = true;
}
for(int i = 1; i <= n; i++) {
scanf("%d", b + i);
inB[b[i]] = true;
}
for(int i = 1; i <= p; i++) scanf("%d", c + i);
int res = 0, d, j;
for(int i = 1; i <= p; i = j + 1) {
j = i;
if (!inB[c[i]]) {
d = 0;
for(j = i; j <= p && !inB[c[j]]; j++) {
if (!chk[c[j]] && inA[c[j]]) d++;
chk[c[j]] = true;
}
if (d >= cnt) res = max(res, j - i);
for(int k = i; k < j; k++) chk[c[k]] = false;
}
}
printf("%d", res);
return 0;
}


#### Code mẫu của RR

#include <sstream>
#include <iomanip>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <deque>
#include <complex>

#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define FORN(i,a,b) for(int i=(a),_b=(b);i<_b;i++)
#define DOWN(i,a,b) for(int i=a,_b=(b);i>=_b;i--)
#define SET(a,v) memset(a,v,sizeof(a))
#define sqr(x) ((x)*(x))
#define ll long long
#define F first
#define S second
#define PB push_back
#define MP make_pair

#define DEBUG(x) cout << #x << " = "; cout << x << endl;
#define PR(a,n) cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl;
#define PR0(a,n) cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl;
using namespace std;

int INP,AM,REACHEOF;
#define BUFSIZE (1<<12)
char BUF[BUFSIZE+1], *inp=BUF;
#define GETCHAR(INP) { \
if(!*inp) { \
if (REACHEOF) return 0;\
memset(BUF,0,sizeof BUF);\
if (inpzzz != BUFSIZE) REACHEOF = true;\
inp=BUF; \
} \
INP=*inp++; \
}
#define DIG(a) (((a)>='0')&&((a)<='9'))
#define GN(j) { \
AM=0;\
GETCHAR(INP); while(!DIG(INP) && INP!='-') GETCHAR(INP);\
if (INP=='-') {AM=1;GETCHAR(INP);} \
j=INP-'0'; GETCHAR(INP); \
while(DIG(INP)){j=10*j+(INP-'0');GETCHAR(INP);} \
if (AM) j=-j;\
}

const long double PI = acos((long double) -1.0);
const int MN = 100111;

bool ina[MN], inb[MN], has[MN];
int a[MN], b[MN], f[MN], m, n, p, c[MN];
vector<int> cur;

int main() {
scanf("%d%d%d", &m, &n, &p);
FOR(i,1,m) scanf("%d", &a[i]);
FOR(i,1,n) scanf("%d", &b[i]);
FOR(i,1,p) scanf("%d", &c[i]);

int la = 0;
FOR(i,1,m) if (!ina[a[i]]) {
ina[a[i]] = true;
++la;
}
FOR(i,1,n) inb[b[i]] = true;

f[0] = 0;
int res = 0;
FOR(i,1,p) {
if (inb[c[i]]) {
f[i] = 0;
REP(x,cur.size()) has[cur[x]] = false;
cur.clear();
}
else {
f[i] = f[i-1] + 1;
if (ina[c[i]] && !has[c[i]]) {
cur.PB(c[i]);
has[c[i]] = true;

}
if (cur.size() == la) {
res = max(res, f[i]);
}
}
}
cout << res << endl;
return 0;
}


#### Code mẫu của hieult

#include <set>
#include <map>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <iostream>
#include <algorithm>

#include <ctime>
#include <deque>
#include <bitset>
#include <cctype>
#include <utility>
#include <cassert>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
typedef unsigned long long ull;

#define Rep(i,n) for(int i = 0; i < (n); ++i)
#define Repd(i,n) for(int i = (n)-1; i >= 0; --i)
#define For(i,a,b) for(int i = (a); i <= (b); ++i)
#define Ford(i,a,b) for(int i = (a); i >= (b); --i)
//#define Fit(i,v) for(__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
//#define Fitd(i,v) for(__typeof((v).rbegin()) i = (v).rbegin(); i != (v).rend(); ++i)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(), (a).end()
#define ms(a,x) memset(a, x, sizeof(a))

template<class F, class T> T convert(F a, int p = -1) { stringstream ss; if (p >= 0) ss << fixed << setprecision(p); ss << a; T r; ss >> r; return r; }
template<class T> T gcd(T a, T b) { T r; while (b != 0) { r = a % b; a = b; b = r; } return a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> T sqr(T x) { return x * x; }
template<class T> T cube(T x) { return x * x * x; }
template<class T> int getbit(T s, int i) { return (s >> i) & 1; }
template<class T> T onbit(T s, int i) { return s | (T(1) << i); }
template<class T> T offbit(T s, int i) { return s & (~(T(1) << i)); }
template<class T> int cntbit(T s) { return s == 0 ? 0 : cntbit(s >> 1) + (s & 1); }

const int bfsz = 1 << 16;
char bf[bfsz + 5];
int rsz = 0;
int ptr = 0;
char gc() {
if (rsz <= 0) {
ptr = 0;
rsz = (int) fread(bf, 1, bfsz, stdin);
if (rsz <= 0)
return EOF;
}
--rsz;
return bf[ptr++];
}
void ga(char &c) {
c = EOF;
while (!isalpha(c))
c = gc();
}
int gs(char s[]) {
int l = 0;
char c = gc();
while (isspace(c))
c = gc();
while (c != EOF && !isspace(c)) {
s[l++] = c;
c = gc();
}
s[l] = '\0';
return l;
}
template<class T> bool gi(T &v) {
v = 0;
char c = gc();
while (c != EOF && c != '-' && !isdigit(c))
c = gc();
if (c == EOF)
return false;
bool neg = c == '-';
if (neg)
c = gc();
while (isdigit(c)) {
v = v * 10 + c - '0';
c = gc();
}
if (neg)
v = -v;
return true;
}

typedef pair<int, int> II;

const ld PI = acos(-1.0);
const ld eps = 1e-13;

const int dr[] = {0, +1, 0, -1};
const int dc[] = {+1, 0, -1, 0};

const int inf = (int)1e9 + 5;
const ll linf = (ll)1e16 + 5;
const ll mod = (ll)1e9 + 7;

#define maxn 200005

int a[maxn], b[maxn], c[maxn], n, m, p;
int f[maxn], flag[maxn];
int res;

void cal(int l, int r){
For(i, l, r) f[c[i]] = 1;
bool check = true;
For(i, 1, n) if(!f[a[i]]){
check = false;
break;
}

if(check) res = max(res, r - l + 1);

For(i, l, r) f[c[i]] = 0;
}

int main(){
//  freopen("in.txt", "r", stdin);

ms(f, 0);
ms(flag, 0);
scanf("%d %d %d", &n, &m, &p);
For(i, 1, n) scanf("%d", &a[i]);
For(i, 1, m){
scanf("%d", &b[i]);
flag[b[i]] = 1;
}
For(i, 1, p) scanf("%d", &c[i]);

int run = 1;
res = 0;
For(i, 1, p){
if(flag[c[i]]){
cal(run, i - 1);
run = i + 1;
}
}

cal(run, p);
cout << res;

return 0;
}


#### Code mẫu của skyvn97

#include<stdio.h>
#define MAX   100010
bool a[MAX];
bool b[MAX];
long c[MAX];
long m,n,p,tmp,y;
long i,j;
long max,cnt,len;
int main(void)
{
scanf("%ld",&m);
scanf("%ld",&n);
scanf("%ld",&p);
y=0;
for (i=1;i<=m;i=i+1)
{
scanf("%ld",&tmp);
if (!a[tmp]) y++;
a[tmp]=true;
}
m=y;
for (i=1;i<=n;i=i+1)
{
scanf("%ld",&tmp);
b[tmp]=true;
}
max=0;
cnt=0;
len=0;
for (i=1;i<=p;i=i+1)
{
scanf("%ld",&tmp);
if (a[tmp])
{
if (!c[tmp]) cnt++;
c[tmp]=true;
len++;
continue;
}
if (b[tmp])
{
if (cnt==m)
{
if (len>max) max=len;
}
for (j=0;j<MAX;j=j+1) c[j]=false;
len=0;
cnt=0;
continue;
}
len++;
}
if ((cnt==m) && (len>max)) max=len;
printf("%ld",max);
return 0;
}