Pagini recente » Cod sursa (job #1859447) | Cod sursa (job #378039) | Cod sursa (job #2721939) | Cod sursa (job #827555) | Cod sursa (job #43695)
Cod sursa(job #43695)
#include<fstream.h>
#include<limits.h>
long n, k;
int v[500000];
void citire()
{
ifstream in("secventa.in");
in>>n>>k;
for (int i=1; i<=n; i++)
in>>v[i];
in.close();
}
void parc()
{
long p, u, l, i, j, min, maxmin;
maxmin=INT_MIN;
for (i=1; i<=n-k+1; i++)
{
min=v[i];
l=1;
p=i;
u=p;
for (j=i+1; j<=n; j++)
{
l++;
if (v[j]<min)
min=v[j];
if (min<maxmin)
{
u=1;
j=n+1;
}
}
if (l>=k)
if (maxmin<min) maxmin=min;
p=i;
u=p+l-1;
}
ofstream out("secventa.out");
out<<p<<" "<<u<<" "<<maxmin;
out.close();
}
int main()
{
citire();
parc();
return 0;
}