Pagini recente » Cod sursa (job #2464191) | Cod sursa (job #2170722) | Cod sursa (job #2433011) | Cod sursa (job #1757816) | Cod sursa (job #696010)
Cod sursa(job #696010)
#include<iostream>
#include<fstream>
using namespace std;
int n,v[5000],s[5000],t[5000],i,j;
int main()
{int aux,k,a,b;
ifstream f("secv.in");
ofstream g("secv.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
t[i]=v[i];
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
if(t[i]>t[j])
{aux=t[j];
t[j]=t[i];
t[i]=aux;}
k=1;
for(i=1;i<=n;i++)
if(t[i]!=s[k-1])
{s[k]=t[i];
k++;}
j=1;
for(i=1;i<=n;i++)
if(s[j]==v[i])
{if(j==1)
a=i;
j++;
if(j==k)
b=i;}
g<<b-a+1;
f.close();
g.close();
return 0;
}