Cod sursa(job #2068306)
| Utilizator | Data | 17 noiembrie 2017 16:05:33 | |
|---|---|---|---|
| Problema | Secventa | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
int a[500005],d[500005],n,k,p,u,maxim,sf;
int main()
{
in>>n>>k;
p=u=1;
d[p]=1;
maxim=-1000000;
in>>a[1];
for (int i=2;i<=n;i++)
{
in>>a[i];
while (a[d[u]]>=a[i]&&p<=u) u--;
u++;
d[u]=i;
if (d[u]-d[p]>=k) p++;
if (i>=k)
{
if (a[d[p]]>maxim) maxim=a[d[p]],sf=i;
}
}
out<<sf-k+1<<" "<<sf<<" "<<maxim;
return 0;
}
