Pagini recente » Cod sursa (job #613920) | Cod sursa (job #2855434) | Solutii preONI 2008, Runda 1 | Cod sursa (job #2354779) | Cod sursa (job #2044994)
#include <fstream>
#define nmax 500005
using namespace std;
fstream f1("secventa.in", ios::in);
fstream f2("secventa.out", ios::out);
int n, k, a[nmax], maxi=-30005, in, sf, prim, ultim, cand[nmax];
///afli max minimelor din secv de k el
void fastscan(int &number)
{
bool negative = false;
register int c;
number = 0;
c = f1.get();
if (c=='-')
{
negative = true;
c = f1.get();
}
for (; (c>47 && c<58); c=f1.get())
number = number *10 + c - 48;
if (negative)
number *= -1;
}
int main()
{
int i;
fastscan(n);
fastscan(k);
for(i=1; i<=n; i++) fastscan(a[i]);
prim=1; ultim=0;
for(i=1; i<=n; i++)
{
while((prim<=ultim)&&(a[cand[ultim]]>= a[i])) ultim--;
ultim++;
cand[ultim]=i;
if((prim<=ultim)&&(cand[prim]== i-k)) prim++;
if((prim<=ultim)&&(i>=k))
{
if(a[cand[prim]]> maxi) {maxi=a[cand[prim]]; in=i-k+1; sf=i;}///min=cand[prim] de pe secv [i-k+1,i]
}
}
f2<<in<<' '<<sf<<' '<<maxi;
return 0;
}