Pagini recente » Cod sursa (job #2379638) | Cod sursa (job #208635) | Cod sursa (job #1100899) | Cod sursa (job #2497604) | Cod sursa (job #716581)
Cod sursa(job #716581)
#include <fstream>
#include <iostream>
using namespace std;
int min(int w[],int k)
{
int m=w[0];
for (int i=1; i<k; i++)
if(w[i]<m)
m=w[i];
return m;
}
void shift_left(int ww[], int k)
{
for (int i=0; i<k-1; i++)
ww[i]=ww[i+1];
}
int main()
{
unsigned long int n,k;
int c=0,poz=0, a, w[500001]={31000};
fstream f("secventa.in",ios::in),g("secventa.out",ios::out);
f>>n>>k;
for (int i=0;i<n ;i++)
{
f>>a;
if (min(w,k)>a)
{
poz=i;
w[0]=a;
for (int j=1;j<k ;j++)
w[j]=31000;
c=1;
}
else
{
if(c<k)
{
w[c]=a;
c++;
}
else
{
shift_left(w,k);
c--;
w[c]=a;
poz++;
}
}
}
g<<poz+1<<" "<<poz+k;
f.close();
g.close();
return(0);
}