Pagini recente » Cod sursa (job #110079) | Cod sursa (job #1824429) | Cod sursa (job #180254) | Cod sursa (job #274761) | Cod sursa (job #298667)
Cod sursa(job #298667)
#include<stdio.h>
#include<values.h>
#include<fstream.h>
long n,i,ii,jj,j,max,maxi,maxj,min,minj;
int main()
{
ifstream be ("ssm.in");
be>>n;
be>>max;
maxi=1;
maxj=1;
for(i=2; i<=n; i++)
{
be>>ii;
ifstream bee ("ssm.in");
min=MAXLONG;
for (j=1; j<=i-1; j++)
{
bee>>jj;
if (jj<min)
{
min=jj;
minj=j;
}
}
bee.close();
if ( max< (ii-min) )
{
max=ii-min;
maxi=i;
maxj=minj;
}
}
ofstream ki ("ssm.out");
ki<<max <<" ";
ki<< (maxj+1) <<" ";
ki<<maxi;
ki.close();
return 0;
}