Pagini recente » Cod sursa (job #1343371) | Cod sursa (job #1548153) | Cod sursa (job #1733417) | Cod sursa (job #1273164) | Cod sursa (job #1774174)
#include <fstream>
using namespace std;
ifstream fi("secventa.in");
ofstream fo("secventa.out");
int n,k,i,a[500001],d[500001],p,u,maxi=-100000000,poz;
int main()
{fi>>n>>k;
for(i=1;i<=n;i++) fi>>a[i];
for(i=1;i<=n;i++)
{
while(p<=u and a[d[u]]>=a[i]) u--;
while(p<=u and d[p] < i-k+1) p++;
d[++u]=i;
if(i>=k and maxi<a[d[p]]) {maxi=a[d[p]];poz=i;}
}
fo<<poz-k+1<<" "<<poz<<" "<<maxi;
return 0;
}