Editorial for Other search problem


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>
using namespace std;

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

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

    int nn = 0;
    while (n--) cin >> x, nn += !cntA[x], cntA[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]] == cntA[c[i]]) ++distinct;
            if (distinct == n) ans = max(ans, i - j + 1);
        }
    }

    cout << ans << endl;
}

Code mẫu của happyboy99x

#include<cstdio>
#include<algorithm>
using namespace std;

const int MAX = 1e5 + 5;
int a[MAX], b[MAX], c[MAX], countA[MAX], countC[MAX], m, n, p;
bool markB[MAX];

void enter() {
    scanf("%d%d%d", &m, &n, &p);
    for(int i = 0; i < m; ++i) scanf("%d", a+i), ++countA[a[i]];
    for(int i = 0; i < n; ++i) scanf("%d", b+i), markB[b[i]] = true;
    for(int i = 0; i < p; ++i) scanf("%d", c+i);
}

int check(int u, int v) { /*Check [u, v)*/
    if(v - u < m) return 0;
    for(int i = u; i < v; ++i) ++countC[c[i]];
    for(int i = 0; i < m; ++i) if(countA[a[i]] > countC[a[i]]) return 0;
    for(int i = u; i < v; ++i) countC[c[i]] = 0;
    return v - u;
}

void solve() {
    int res = 0; c[p] = b[0];
    for(int s = 0, i = 0; i <= p; ++i) if(markB[c[i]]) res = max(res, check(s, i)), s = i+1;
    printf("%d\n", res);
}

int main() {
    enter();
    solve();
    return 0;
}

Code mẫu của ladpro98

#include <bits/stdc++.h>
const int N = 100005;
using namespace std;
int m, n, p;
int a[N], b[N], c[N], Fa[N], Fb[N], cnt[N];

int main() {
    scanf("%d %d %d", &m, &n, &p);
    for(int i = 1; i <= m; i++) scanf("%d", a + i), cnt[a[i]] = ++Fa[a[i]];
    for(int i = 1; i <= n; i++) scanf("%d", b + i), Fb[b[i]]++;
    for(int i = 1; i <= p; i++) scanf("%d", c + i);
    int j = 0, res = 0;
    for(int i = 1; i <= p; i = j = j + 1)
    if (Fb[c[i]] == 0) {
        int k = 0;
        for(; j <= p && Fb[c[j]] == 0; j++)
            if (cnt[c[j]] > 0) k++, cnt[c[j]]--;
        if (k == m) res = max(res, j - i);
        for(int t = i; t < j; t++) cnt[c[t]] = Fa[c[t]];
    }
    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;

//Buffer reading
int INP,AM,REACHEOF;
const int BUFSIZE = (1<<12) + 17;
char BUF[BUFSIZE+1], *inp=BUF;
#define GETCHAR(INP) { \
    if(!*inp && !REACHEOF) { \
        memset(BUF,0,sizeof BUF);\
        int inpzzz = fread(BUF,1,BUFSIZE,stdin);\
        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;\
}
//End of buffer reading

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

int na, nb, nc, a[MN], b[MN], c[MN], ina[MN], inb[MN], inc[MN], has[MN];
int sa, sb, sc, res;

void solve(int l, int r) {
    if (l > r) return ;

    if (r - l + 1 < res) return ;

    int good = 0;
    FOR(i,l,r) {
        ++has[c[i]];
        if (has[c[i]] == ina[c[i]]) ++good;
    }

    if (good == sa) res = r - l + 1;

    FOR(i,l,r) --has[c[i]];
}

int main() {
    while (scanf("%d%d%d", &na, &nb, &nc) == 3) {
        res = 0;
        memset(ina, 0, sizeof ina);
        memset(inb, 0, sizeof inb);
        memset(inc, 0, sizeof inc);

        FOR(i,1,na) {
            scanf("%d", &a[i]);
            if (!ina[a[i]]) ++sa;
            ina[a[i]]++;
        }
        FOR(i,1,nb) {
            scanf("%d", &b[i]);
            if (!inb[b[i]]) ++sb;
            inb[b[i]]++;
        }
        FOR(i,1,nc) {
            scanf("%d", &c[i]);
            if (!inc[c[i]]) ++sc;
            inc[c[i]]++;
        }

        int lastb = 0;
        FOR(i,1,nc)
        if (inb[c[i]]) {
            solve(lastb+1, i-1);
            lastb = i;
        }
        solve(lastb+1, nc);
        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], num[maxn];
int res;

void cal(int l, int r){
    For(i, l, r) f[c[i]]++;
    bool check = true;
    For(i, 1, n) if(f[a[i]] < num[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);
    ms(num, 0);
    scanf("%d %d %d", &n, &m, &p);
    For(i, 1, n) {
        scanf("%d", &a[i]);
        num[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
long a[MAX];
long b[MAX];
long c[MAX];
long m,n,p;
long max,len,cnt;
long i,j,tmp;
int main(void)
{
    scanf("%ld",&m);
    scanf("%ld",&n);
    scanf("%ld",&p);
    for (i=1;i<=m;i=i+1)
        {
         scanf("%ld",&tmp);
         a[tmp]++;
        }
    for (i=1;i<=n;i=i+1)
        {
         scanf("%ld",&tmp);
         b[tmp]++;
        }
    max=0;
    len=0;
    cnt=0;    
    for (i=1;i<=p;i=i+1)
        {
         scanf("%ld",&tmp);
         if ((a[tmp]>0) && (b[tmp]>0))
            {
             printf("0");
             return 0;
            }
         if (a[tmp]>c[tmp])
            {
             c[tmp]++;
             len++;
             cnt++;
             continue;
            }
         if (b[tmp]>0)
            {
             if (cnt==m)
                {
                 if (len>max) max=len;
                }
             for (j=0;j<MAX;j=j+1) c[j]=0;
             cnt=0;
             len=0;
             continue;
            }
         len++;
        }
    if ((cnt==m) && (len>max)) max=len;
    printf("%ld",max);
    return 0;
}

Comments

Please read the guidelines before commenting.


There are no comments at the moment.