Cod sursa(job #2580136)
| Utilizator | Data | 13 martie 2020 12:50:55 | |
|---|---|---|---|
| Problema | Secventa | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.73 kb |
#include <fstream>
#include <deque>
#define Nmax 500010
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
deque <int> d;
int n,k,v[Nmax],max1=-300000,in,sf;
int main()
{
int i;
fin>>n>>k;
for (i=1;i<=n;i++)
{
fin>>v[i];
while (!d.empty() && v[i]<=v[d.back()])
d.pop_back();
d.push_back(i);
if (i>k)
{
if (d.front()==i-k)
d.pop_front();
}
if (i>=k)
{
if (max1<v[d.front()])
{
max1=v[d.front()];
in=i-k+1;
sf=i;
}
}
}
fout<<in<<" "<<sf<<" "<<max1;
return 0;
}
