Cod sursa(job #2098184)
| Utilizator | Data | 2 ianuarie 2018 15:23:34 | |
|---|---|---|---|
| Problema | Secventa | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.66 kb |
#include<fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n, p, u, d[500004], imax, maxim, k, s, a[500004], i;;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
p=u=d[1]=1;
maxim=-30005;
for(i=2;i<=n;i++)
{
while(p<=u && a[i]<a[d[u]])
u--;
d[++u]=i;
if(i-d[p]==k)
p++;
if(i>=k)
{
if(a[d[p]]>maxim)
{
maxim=a[d[p]];
imax=i;
}
//g<<" "<<a[d[p]];<<"\n"
}
}
g<<imax-k+1<<" "<<imax<<" "<<maxim<<"\n";
return 0;
}
