Pagini recente » Cod sursa (job #1536241) | Cod sursa (job #2863823) | Cod sursa (job #2542660) | Cod sursa (job #115509) | Cod sursa (job #738815)
Cod sursa(job #738815)
#include<fstream>
using namespace std;
int n,k,maxi,x,y,i,p,u,d[500002],a[500002];
ifstream f("secventa.in");
ofstream g("secventa.out");
int main()
{
f>>n>>k;
p=1;
maxi=-32002;
for(i=1;i<=n;i++)
{
f>>a[i];
while(a[i]<=a[d[u]]&&u>0&&p<=u) u--;
u++;
d[u]=i;
if(i-d[p]+1>k) p++;
if(i>=k&&a[d[p]]>maxi)
{
maxi=a[d[p]];
x=i-k+1;
y=i;
}
}
g<<x<<" "<<y<<" "<<maxi<<'\n';
f.close();
g.close();
return 0;
}