Cod sursa(job #1621570)
| Utilizator | Data | 29 februarie 2016 20:02:13 | |
|---|---|---|---|
| Problema | Secventa | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int a[500001],d[500001];
int main()
{
int i,n,k,head,tail,in,t,nr;f>>n>>k;
nr=-10000000;head=1;tail=0;
for(i=1;i<=n;i++)f>>a[i];
for(i=1;i<=n;i++)
{
while(head<=tail&&a[i]<=a[d[tail]])--tail;
d[++tail] = i;
if(i-k==d[head])head++;
if(i>=k&&nr<a[d[head]])
{ nr=a[d[head]]; in=i-k+1; t=i; }
}
g<<in<<" "<<t<<" "<<nr;
return 0;
}
