Pagini recente » Segmente | Diferente pentru algoritmiada-2011/premii intre reviziile 2 si 4 | Monitorul de evaluare | Monitorul de evaluare | Cod sursa (job #2059181)
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n,k,i,nn;
int D[500002],v[500002];
int maxim,p,u;
int poz,ok,nr;
char s[2000000];
int main()
{
fin >> n >> k;
fin.get();
fin.getline(s, 2000000);
for (i=0; s[i]!=0; i++)
{
if (s[i] == '-')
{
ok = 1;
continue;
}
if (s[i] == ' ')
{
if (ok == 1)
nr = -nr;
v[++nn] = nr;
nr = 0;
ok = 0;
}
else
nr = nr*10+(s[i]-'0');
}
v[++nn] = nr;
maxim = -30002;
p = 1;
u = 1;
D[p] = 1;
for (i=2; i<=n; i++)
{
while (p <= u && v[i] <= v[D[u]])
u--;
D[++u] = i;
while (p <= u && i-D[p] >= k)
p++;
if (v[D[p]] > maxim && i >= k)
maxim = v[D[p]], poz = i;
}
fout << poz-k+1 << " " << poz << " " << maxim;
return 0;
}