Pagini recente » Cod sursa (job #2415132) | Cod sursa (job #2125197) | Cod sursa (job #491956) | Cod sursa (job #934873) | Cod sursa (job #1808012)
#include <fstream>
#include <cstring>
using namespace std;
unsigned int N, L, U;
unsigned long int a[1100000];
unsigned long int maximum, val;
unsigned long int i, j, k;
unsigned long int sol;
int main ()
{
ifstream fin ("secv5.in");
fin >> N >> L >> U;
for (i=1; i<=N; i++)
fin >> a[i];
fin.close();
maximum = a[1];
for (i=2; i<=N; i++)
if (a[i] > maximum)
maximum = a[i];
unsigned long int b[maximum+2];
for (i=1; i<=N; i++)
for (j=i+1; j<=N; j++)
{
val = 0;
memset(b,0,sizeof(b));
for (k=i; k<=j; k++)
b[a[k]]++;
for (k=1; k<=maximum; k++)
if (b[k] != 0)
val++;
if (val >= L && val <= U)
sol++;
}
ofstream fout ("secv5.out");
fout << sol;
fout.close();
return 0;
}