Pagini recente » Clasament wellcodesimulareclasa11-12-12martie | Cod sursa (job #1237338) | Cod sursa (job #77995) | Cod sursa (job #749240) | Cod sursa (job #52625)
Cod sursa(job #52625)
#include<fstream.h>
#include<limits.h>
long long a[500000], n, k, min;
void citire()
{
long long i;
ifstream in("secventa.in");
in>>n>>k;
for (i=1; i<=n; i++)
in>>a[i];
in.close();
}
long long cautare(long long p, long long u)
{
long long i, minim;
minim=a[p];
for (i=p+1; i<=u; i++)
if (a[i]<minim) minim=a[i];
return minim;
}
void calcul()
{
long long i, j, ii, jj;
min=LONG_MIN;
for (i=1; i<=n-k+1; i++)
for (j=i+k-1; j<=n; j++)
if (min<cautare(i,j))
{
min=cautare(i,j);
ii=i; jj=j;
}
ofstream out("secventa.out");
out<<ii<<" "<<jj<<" "<<min;
out.close();
}
int main()
{
citire();
calcul();
return 0;
}