Pagini recente » Cod sursa (job #2504374) | Cod sursa (job #2291975)
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n,k,p,u,i,v[500010],d[500010],st,dr,sol;
inline void f() {
fin>>n>>k; sol=-2000000;
for (i=1;i<=n;i++)
fin>>v[i];
p=1; u=1; d[1]=1;
for (i=2;i<=n;i++) {
while (v[i]<v[d[u]]&&p<=u)
u--;
d[++u]=i;
if (i-d[p]==k)
p++;
if (i>=k&&v[d[p]]>sol) {
sol=v[d[p]];
st=i-k+1;
dr=i;
}
}
fout<<st<<" "<<dr<<" "<<sol;
return;
}
int main() {
f();
return 0;
}