Cod sursa(job #2410009)
| Utilizator | Data | 19 aprilie 2019 17:17:01 | |
|---|---|---|---|
| Problema | Secventa | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,i,j;
int p=1,q=1;
int v[500001],dmin[500001];
int maxim,poz1,poz2,poz;
int main()
{
f>>n>>k;
for (i=1;i<=n;i++)
f>>v[i];
for (i=1;i<=n;i++)
{
while (p<=q && v[dmin[q]]>=v[i])
q--;
q++;
dmin[q]=i;
if (i==k+dmin[p])
p++;
if (v[dmin[p]]>maxim && i>=k)
{
maxim=v[dmin[p]];
poz1=i-k+1;
poz2=i;
}
}
g<<poz1<<" "<<poz2<<" "<<maxim;
return 0;
}
