Przejdź do treści

C++ - rozwiązanie

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include <cstdio>
#include <iostream>
#include <map>
#include <vector>

using namespace std;

int main()
{
    unsigned int cases, n, maxSnowflakes, startIndex, index;
    map<unsigned int, unsigned int> lastIndex;
    vector<unsigned int> snowflakes;

    scanf("%u", &cases);

    for (int testCase = 1; testCase <= cases; ++testCase)
    {
        scanf("%u", &n);

        lastIndex.clear();
        maxSnowflakes = 0;
        startIndex = 1;
        snowflakes = vector<unsigned int>(n);

        for (int i = 1; i <= n; i++)
        {
            scanf("%u", &snowflakes[i]);
        }

        for (int i = 1; i <= n; i++)
        {
            index = lastIndex[snowflakes[i]];
            if (index != 0)
            {
                while (startIndex <= index)
                {
                    lastIndex[snowflakes[startIndex]] = 0;
                    ++startIndex;
                }
            }

            lastIndex[snowflakes[i]] = i;
            maxSnowflakes = max(maxSnowflakes, i - startIndex + 1);
        }

        printf("%u\n", maxSnowflakes);
    }

    return 0;
}