Pagini recente » Cod sursa (job #1007492) | Borderou de evaluare (job #565513) | Cod sursa (job #352659) | Cod sursa (job #3161225) | Cod sursa (job #676450)
Cod sursa(job #676450)
#include<fstream>
using namespace std;
ifstream f("secv.in");
ofstream g("secv.out");
int i,j,k,l,maxx=5000,p,ptima,x,ci,z,y,v,pi, N;
long long a[2000010];
int main (){
f>>N;
if(N>5000)
return 0;
for(i=1;i<=N;i++)
f>>a[i];
pi=a[1];
for (i=1;i<=N;i++){
for (j=1;j<=N;j++){
if((a[j]<pi)&&(a[j]!=0)){
p=j;
pi=a[j];}}
for (j=i;j<=N;j++){
if(a[j]>pi){
l++;
pi=a[j];
ptima=j;}}
z=ptima-p+1;
if((maxx>z)&&(l>ci)){
maxx=z;
ci=l;
l=0;
x=p;
y=ptima;
v=pi;}
l=0;
for (k=1;k<=N;k++){
if(a[k]==pi)
a[k]=0;} }
z=y-x+1;
if(z<=0)
g<<-1;
else
g<<z;
return 0;
}