SEARCH - Dãy số

Tác giả: happyboy99x

Ngôn ngữ: C++

#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;
}

Download