Pagini recente » Cod sursa (job #238469) | Cod sursa (job #1438544) | Cod sursa (job #1201846) | Cod sursa (job #1760486) | Cod sursa (job #1144114)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n, k, elem, a[500001], deq[500001], i, p, u, j, Max=-30010, sts, drs, l, m=1, nr=0;
char ch[4000005];
int main()
{
f>>n>>k;
f.get();
f.get(ch,4000005);
for (i=0; ch[i]!=0; i++)
{
if(ch[i] >= '0' && ch[i] <= '9')
{
nr = nr*10 + (ch[i]-'0');
}
if (ch[i]=='-')
m=-1;
if (ch[i]==' ')
{
l++;
a[l]=nr*m;
m=1;
nr=0;
}
}
a[++l]=nr*m;
p=1;
u=0;
nr=0;
for (i=1; i<=n; i++) {
while (a[deq[u]] > a[i] && u>=p)
u--;
deq[++u]=i;
while (i-nr>k) {
nr++;
if (nr==deq[p])
p++;
}
if (i-nr==k) {
if (Max < a[deq[p]]) {
Max=a[deq[p]];
sts=nr+1;
drs=i;
}
}
}
g<<sts<<" "<<drs<<" "<<Max;
return 0;
}