Mai intai trebuie sa te autentifici.
Cod sursa(job #1064730)
Utilizator | Data | 22 decembrie 2013 12:07:24 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n, k, elem, a[500001], deq[500001], i, st=1, dr, j, Max, sts, drs;
int main()
{
f>>n>>k;
for (i=1; i<=n; i++)
f>>a[i];
for (i=1; i<=n; i++)
{
while (st<=dr && a[i] <= a[deq[dr]])
dr--;
deq[++dr]=i;
if (i-k == deq[st])
st++;
if (i>=k)
{
if (a[deq[st]] > Max)
{
Max=a[deq[st]];
drs=deq[dr];
sts=drs-k+1;
}
}
}
g<<sts<<" "<<drs<<" "<<Max;
return 0;
}