Pagini recente » Cod sursa (job #2729706) | Cod sursa (job #2707126) | Cod sursa (job #2127572) | Cod sursa (job #708107) | Cod sursa (job #2689399)
#include <fstream>
#include <map>
using namespace std;
int n, v[ 1 << 20 + 1 ];
map< int, int > a;
int caca( int limita ){
long long rez = 0;
int i = 0, cate = 0, st = 0;
for( ; i < n; i++ ){
if( a[ v[ i ] ] == 0 )
while( st <= i && cate == limita ){
if( --a[ v[ st ] ] == 0 )
--cate;
++st;
}
if( ++a[ v[ i ] ] == 1 )
++cate;
rez += ( long long )i - st + 1;
}
a.clear();
return rez;
}
int main()
{
int st, dr;
ifstream cin( "secv5.in" );
cin >> n >> st >> dr;
for( int i = 0; i < n; i++ )
cin >> v[ i ];
cin.close();
ofstream cout( "secv5.out" );
cout << caca( dr ) - caca( st - 1 ) << '\n';
return 0;
}