Pagini recente » Cod sursa (job #1493297) | Cod sursa (job #58354) | Cod sursa (job #429857) | Cod sursa (job #1151675) | Cod sursa (job #696059)
Cod sursa(job #696059)
#include<iostream>
#include<fstream>
#define DN 30005
#define DM 500005
using namespace std;
int a[DM],n, k, min1=DN, max1=-DN, poz, sf, i, j;
ifstream f("secventa.in");
ofstream g("secventa.out");
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>a[i];
if(min1>=a[i])
min1=a[i], poz=i;
if(poz<=i-k && i>=k)
{
min1=DN;
for(j=i-k+1;j<=i;j++)
if(a[j]<min1)
min1=a[j],poz=j;
if(min1>max1)
max1=min1,sf=i;
}
if(min1>max1 && i>=k)
max1=min1, sf=i;
}
g<<sf-k+1<<" "<<sf<<" "<<max1;
f.close();g.close();
}