Pagini recente » Cod sursa (job #488992) | Cod sursa (job #56943) | Cod sursa (job #1350219) | Cod sursa (job #2135146)
#include <fstream>
#define maxim 500005
using namespace std;
fstream f1("secventa.in", ios::in);
fstream f2("secventa.out", ios::out);
int n, k, a[maxim], prim=1, ultim, cand[maxim], in, sf, maxi=-30001;
int main()
{
int i;
f1>>n>>k;
for(i=1; i<=n; i++) f1>>a[i];
for(i=1; i<=n; i++)
{
if(cand[prim]==i-k) prim++;
while((prim<=ultim)&&(a[cand[ultim]]>= a[i])) ultim--;
ultim++;
cand[ultim]=i;
if((maxi< a[cand[prim]])&&(i>=k))
{
in=i-k+1;
sf=i;
maxi=a[cand[prim]];
}
}
f2<<in<<' '<<sf<<' '<<maxi;
return 0;
}