Pagini recente » Cod sursa (job #1023957) | Cod sursa (job #2225571) | Cod sursa (job #751105) | Cod sursa (job #855673) | Cod sursa (job #1073732)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n, k, elem, a[500001], deq[500001], i, st=1, dr, 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;
for (i=1; i<=n; i++)
{
while (st<=dr && a[i] <= a[deq[dr]])
dr--;
deq[++dr]=i;
if (i-k == deq[st])
st++;
if (i>=k)
{
if (a[deq[st]] > Max)
{
Max=a[deq[st]];
drs=i;
}
}
}
g<<drs-k+1<<" "<<drs<<" "<<Max;
return 0;
}