Cod sursa(job #1106538)
Utilizator | Data | 12 februarie 2014 21:32:00 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.71 kb |
#include <fstream>
#include <deque>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int i,j,k,N,M,D,a,b,X,Y,rasp=-1<<30;
deque <int> mini,maxi;
int v[500005];
int main()
{
f>>N>>D;
for (i=1;i<=N;++i)
{
f>>v[i];
while (mini.size()&&v[mini.back()]>v[i])
mini.pop_back();
mini.push_back(i);
if (mini.front()<=i-D)
mini.pop_front();
if (mini.size()>=D-1&&v[mini.front()]>rasp)
{
X=i-D+1;
Y=i;
rasp=v[mini.front()];
}
}
g<<X<<" "<<Y<<" "<<rasp;
return 0;
}