Pagini recente » Cod sursa (job #2496277) | Monitorul de evaluare | Cod sursa (job #1240246) | Cod sursa (job #2456157) | Cod sursa (job #716619)
Cod sursa(job #716619)
#include <fstream>
#include <iostream>
using namespace std;
int min(int w[],unsigned long int p, unsigned long int k)
{
int m=w[p];
for (int i=p+1; i<k; i++)
if(w[i]<m)
m=w[i];
return m;
}
int main()
{
unsigned long int n, k, c=1 ,p=0, poz=0;
int a[500001];
fstream f("secventa.in",ios::in);
f>>n>>k;
for (int i=0;i<n ;i++)
{
f>>a[i];
}
f.close();
for (int i=1;i<n ;i++)
{
if (min(a,p,c)>a[i])
{
p=i;
c=1;
}
else
{
if(c<k)
{
c++;
}
else
{
p++;
//c--;
}
}
if(c==k)
{
if (min(a,poz,k)<min(a,p,k))
poz=p;
}
}
fstream g("secventa.out",ios::out);
g<<poz+1<<" "<<poz+k<<" "<<min(a,poz,k);
g.close();
return(0);
}