Pagini recente » Cod sursa (job #1954982) | Borderou de evaluare (job #1551186) | Cod sursa (job #220039) | Cod sursa (job #3207238) | Cod sursa (job #670859)
Cod sursa(job #670859)
#include<iostream>
#include<fstream>
#define DN 30005
#define DM 500005
using namespace std;
int a[DM];
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int main()
{
int n, k, min1=DN, max1=-DN, poz, sf, i, j;
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>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(max1>min1 && i>=k)
max1=min1, sf=i;
}
}
fout<<sf-k+1<<" "<<sf<<" "<<max1;
}