Unique Snowflakes UVA - 11572 （离散化+尺取法）

Emily the entrepreneur has a cool business idea: packaging and selling snowflakes. She has devised a machine that captures snowflakes as they fall, and serializes them into a stream of snowflakes that flow, one by one, into a package. Once the package is full, it is closed and shipped to be sold. The marketing motto for the company is “bags of uniqueness.” To live up to the motto, every snowflake in a package must be different from the others. Unfortunately, this is easier said than done, because in reality, many of the snowflakes flowing through the machine are identical. Emily would like to know the size of the largest possible package of unique snowflakes that can be created. The machine can start filling the package at any time, but once it starts, all snowflakes flowing from the machine must go into the package until the package is completed and sealed. The package can be completed and sealed before all of the snowflakes have flowed out of the machine. Input The first line of input contains one integer specifying the number of test cases to follow. Each test case begins with a line containing an integer n, the number of snowflakes processed by the machine. The following n lines each contain an integer (in the range 0 to 109 , inclusive) uniquely identifying a snowflake. Two snowflakes are identified by the same integer if and only if they are identical. The input will contain no more than one million total snowflakes. Output For each test case output a line containing single integer, the maximum number of unique snowflakes that can be in a package.

Sample Input 1 5 1 2 3 2 1 Sample Output 3

题意：求没有重复数字的最长区间.

思路：由于数组中元素的范围太大，上限为1e9，但是最多只有1e5个数，所以我们需要离散化一下，也可以不用离散化，直接用map进行标记。

然后快乐的尺取法。

我们维护一个区间，[ l , r ] ，使这个区间里的元素总是没有重复的，

当R向右移动后，如果有重复的就把L一直向右推，直到区间里没有重复元素，（因为[L,R] 不符合条件，那么[L,R+1]一定也不符合，所以要改变的是L，）

每一次符合条件后就立即停止L的右推，更新答案，然后移动R，

总体时间复杂度O（n*long n+ n）

细节见我的AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define rep(i,x,n) for(int i=x;i<n;i++)
#define repd(i,x,n) for(int i=x;i<=n;i++)
#define pii pair<int,int>
#define pll pair<long long ,long long>
#define gbtb ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define MS0(X) memset((X), 0, sizeof((X)))
#define MSC0(X) memset((X), '\0', sizeof((X)))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define eps 1e-6
#define gg(x) getInt(&x)
#define db(x) cout<<"== [ "<<x<<" ] =="<<endl;
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll powmod(ll a,ll b,ll MOD){ll ans=;while(b){if(b%)ans=ans*a%MOD;a=a*a%MOD;b/=;}return ans;}
inline void getInt(int* p);
const int maxn=;
const int inf=0x3f3f3f3f;
/*** TEMPLATE CODE * * STARTS HERE ***/
int t;
int n;
int a[maxn];
int b[maxn];
// map<int,int> bj;
int bj[maxn];
int main()
{
    gg(t);
    while(t--)
    {
        gg(n);
        repd(i,,n)
        {
            gg(a[i]);
            b[i]=a[i];
        }
        sort(b+,b++n);
        int cnt=unique(b+,b++n)-b-;
        repd(i,,n)
        {
            a[i]=lower_bound(b+,b++cnt,a[i])-b;
        }
        // repd(i,1,n)
        // {
        //     db(a[i]);

        int ans=;
        int l=;
        int r=;
        MS0(bj);
        bj[a[]]++;bj[a[]]++;
        while(r<=n)
        {
            while(bj[a[r]]>)
                bj[a[l++]]--;
            ans=max(ans,r>n?r-l:r-l+);
            bj[a[++r]]++;
        }
        printf("%d\n",ans );
    }
    return ;
}

inline void getInt(int* p) {
    char ch;
    do {
        ch = getchar();
    } while (ch == ' ' || ch == '\n');
    if (ch == '-') {
        *p = -(getchar() - '');
        while ((ch = getchar()) >= '' && ch <= '') {
            *p = *p *  - ch + '';
        }
    }
    else {
        *p = ch - '';
        while ((ch = getchar()) >= '' && ch <= '') {
            *p = *p *  + ch - '';
        }
    }
}