Pagini recente » Cod sursa (job #2260592) | Cod sursa (job #1619528) | Cod sursa (job #2723760) | Cod sursa (job #2116447) | Cod sursa (job #1507590)
#include <fstream>
#include <string>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,deq[500001],a[500001];
int minim=-30001,p1;
char s[500001];
int main()
{
f>>n>>k;
f.getline(s,500001,EOF);
n=0;
int prim=1,ultim=0;
bool minus=false;
for(int i=0;s[i];i++)
{
minus=false;
if(s[i]=='-')
{
++i;
minus=true;
}
if(isdigit(s[i]))
{
++n;
for(;isdigit(s[i]);i++)
a[n]=a[n]*10+s[i]-'0';
if(minus)
a[n]*=-1;
}
}
for(int i=1;i<=n;++i)
{
while(prim<=ultim&&a[i]<a[deq[ultim]])
ultim--;
ultim++;
deq[ultim]=i;
if(deq[prim]==i-k)
prim++;
if(i>=k&&minim<a[deq[prim]])
{
minim=a[deq[prim]];
p1=i;
}
}
g<<p1-k+1<<" "<<p1<<" "<<minim;
return 0;
}