Cod sursa(job #943680)

Utilizator claudiumihailClaudiu Mihail claudiumihail Data 26 aprilie 2013 09:10:14
Problema Secventa 5 Scor 50
Compilator cpp Status done
Runda Arhiva de probleme Marime 2.24 kb
#include <fstream>
#include <iostream>
#include <map>
#include <hash_map>
#include <iterator>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
 
#define MAXN ((1<<20) + 1)
 
using namespace std;
using namespace __gnu_cxx;
 
unsigned int vec[MAXN];
int minimumSpans[MAXN];
//int maximumSpans[MAXN];

char buffer[32];
 
int main()
{
    int n, L, U;
    long long numSecv = 0;
    FILE* fin = fopen ("secv5.in" , "r");
    fstream fout("secv5.out", fstream::out);
     
    //fin >> n >> L >> U;
    fscanf(fin, "%d %d %d", &n, &L, &U);
    //cout << n << " " << L << " " << U << endl;

    fgets(buffer, 32, fin);
    for (int i=1; i<=n; ++i)
    {
        //fin >> vec[i];
        fgets(buffer, 32, fin);
        vec[i] = strtoul(buffer, NULL, 0);
        //cout << vec[i] << " ";
    }
    //cout << endl;
 
    map<unsigned int, int> mapDistincts;
    int distincts = 0;
    int span = 1;
     
    for (int i=1; i<=n; ++i)
    {
        mapDistincts[vec[i]]++;
        if (mapDistincts[vec[i]] == 1)
        {
            distincts++;
        }
         
        while (distincts > L-1)
        {
            mapDistincts[vec[span]]--;
            if (mapDistincts[vec[span]] == 0)
            {
                distincts--;
            }
             
            span++;
        }
         
        minimumSpans[i] = span;
    }
     
    ostream_iterator<int> itOut(cout, " ");
    //copy(minimumSpans, minimumSpans + n + 1, itOut);
    //cout << endl;
     
    mapDistincts.clear();
    distincts = 0;
    span = 1;
     
    for (int i=1; i<=n; ++i)
    {
        mapDistincts[vec[i]]++;
        if (mapDistincts[vec[i]] == 1)
        {
            distincts++;
        }
         
        while (distincts > U)
        {
            mapDistincts[vec[span]]--;
            if (mapDistincts[vec[span]] == 0)
            {
                distincts--;
            }
             
            span++;
        }
         
        //maximumSpans[i] = span;
         
        numSecv += (minimumSpans[i] - span);
    }
 
    //copy(maximumSpans, maximumSpans + n + 1, itOut);
    //cout << endl;
     
    fout << numSecv << "\n";
     
    return 0;
}