Pagini recente » Cod sursa (job #2041123) | Cod sursa (job #889575) | Cod sursa (job #1348325) | Cod sursa (job #1061816) | Cod sursa (job #2033935)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n, l, u, i, j, contordis, nrsec = 0, k, ib, ok;
ifstream in("secv5.in");
ofstream out("secv5.out");
in >> n;
in >> l;
in >> u;
int a[n], b[n];
for(i = 0; i < n; i++)
{
in >> a[i];
}
for(i = 0; i < n; i++)
{
k = 0;
ok = 0;
for(j = i; j < n; j++)
{
b[j] = a[k];
if(k >= 1)
{
do
{
ok = 1;
for(ib = 0; ib <= k; ib++)
if(b[ib] < b[ib+1])
{
swap(b[ib], b[ib+1]);
ok = 0;
}
}while(ok == 0);
contordis = 0;
for(ib = 0; ib <= k; ib++)
{
if(b[ib] != b[ib+1])
{
if(contordis > 0)
contordis++;
else contordis+=2;
}
}
}
if(contordis <= u && contordis >= l)
{
nrsec++;
}
k++;
}
}
out << nrsec;
return 0;
}