Pagini recente » Cod sursa (job #3030847) | Cod sursa (job #2538456) | Cod sursa (job #2780249) | Cod sursa (job #618176) | Cod sursa (job #1512579)
# include <iostream>
# include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int a[500001], prim, ulti, c[500001];
int main()
{
int n, k, s, d, maxi=-32001, i;
f>>n>>k;
for (i=1; i<=n; i++)
f>>a[i];
i=1;
prim=1; ulti=0;
while (i<=n)
{
while (prim<=ulti && a[i]<a[c[ulti]])
ulti--;
c[++ulti]=i;
if (c[prim]<=i-k)
prim++;
if (i>=k)
if (a[c[prim]]>maxi)
{
maxi=a[c[prim]];
s=i-k+1;
d=i;
}
else
if (a[c[prim]]==maxi && c[prim]<s)
{
s=i-k+1;
d=i;
}
i++;
}
g<<s<<' '<<d<<' '<<maxi;
}