Pagini recente » Cod sursa (job #2840137) | Cod sursa (job #2061872) | Cod sursa (job #2387321) | Cod sursa (job #1632149) | Cod sursa (job #1698715)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int x[500002];
int main()
{
int n,i,k,mini=2000000,p,q,j,maxi=-1000000;
f>>n>>k;
for(i=1;i<=n;i++)
f>>x[i];
for(i=1;i<=k;i++)
if(x[i]<mini)
mini=x[i];
{
if(mini>maxi)
{
maxi=mini;
p=1;
q=k;
}
}
for(i=k+1;i<=n;i++)
{
if(x[i]<mini)
{
mini=x[i];
if(mini>maxi)
{
maxi=mini;
p=i-k+1;
q=i;
}
}
else
{
if(x[i-k]==mini)
{
mini=2000000;
for(j=i-k+1;j<=i;j++)
if(x[j]<mini)
mini=x[j];
if(mini>maxi)
{
maxi=mini;
p=i-k+1;
q=i;
}
}
}
}
g<<p<<' '<<q<<' '<<maxi;
return 0;
}