Pagini recente » Cod sursa (job #782279) | Cod sursa (job #2435714) | Monitorul de evaluare | Cod sursa (job #260145) | Cod sursa (job #845830)
Cod sursa(job #845830)
#include<cstdio>
#include<utility>
#include<deque>
#include<fstream>
using namespace std;
deque< pair<int,int> > a;
int i,j,n,x,k,imax,jmax,bazmax=-30001,sign;
char s[10000005];
int main()
{
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
scanf("%d%d\n",&n,&k);
fgets(s,10000005,stdin); j=0;
for(i=1;i<=n;i++)
{
sign=1; x=0;
if(s[j]==' ') j++;
if(s[j]=='-') {sign=-1; j++;}
while('0'<=s[j] && s[j]<='9') {x=x*10+s[j]-'0'; j++;}
x=x*sign;
if(a.empty()) {a.push_back(make_pair(x,i)); continue;}
while((!a.empty())&&(a.back().first>x)) a.pop_back();
a.push_back(make_pair(x,i));
while(a.front().second<i-k+1) a.pop_front();
if(i>=k) if(a.front().first>bazmax) {bazmax=a.front().first; jmax=i;}
}
imax=jmax-k+1;
printf("%d %d %d",imax,jmax,bazmax);
return 0;
}