Pagini recente » Cod sursa (job #607594) | Cod sursa (job #1804540) | Cod sursa (job #1528066) | Cod sursa (job #1925573) | Cod sursa (job #731053)
Cod sursa(job #731053)
#include<fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int i,b,n,x,j,a[500001];
int min1;
int k,p;
void read()
{
f>>n>>k;
for(i=0;i<=n;i++)
f>>a[i];
min1=a[0];
b=min1;
x=k;
p=1;
}
void solve()
{
read();
for(i=1;i<=n-k+1;i++)
{
if(i==1)
{
for(j=1;j<k;j++)
if(a[j]<min1)
min1=a[j];
b=min1;
}
if(a[i-1]>min1)
{
if(a[k+i]<min1)
min1=a[k+i];
}
else
{
min1=a[i];
for(j=i+1;j<k+i;j++)
if(a[j]<min1)
min1=a[j];
}
if(min1>b)
{
b=min1;
p=i+1;
x=i+k;
}
}
}
void scrie()
{
solve();
g<<p<<' '<<x<<' '<<b<<'\n';
}
int main()
{
scrie();
return 0;
}