Cod sursa(job #2045130)
Utilizator | Data | 21 octombrie 2017 20:55:08 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <bits/stdc++.h>
#define Nmax 500001
using namespace std;
FILE *f = fopen("secventa.in","r");
FILE *g = fopen("secventa.out","w");
int n,k,v[Nmax],lst,mx,sav;
vector<pair<int,int> > Q;
int main()
{
fscanf(f,"%ld%ld",&n,&k);
for (int i=1;i<=n;i++)
{
fscanf(f,"%d",&v[i]);
while (lst<Q.size() && Q.back().first>=v[i])
Q.pop_back();
Q.push_back({v[i],i});
if (Q[lst].second<i-k+1)
lst++;
if (mx<Q[lst].first)
{mx = Q[lst].first,sav = i-k+1;}
}
fprintf(g,"%d %d %d",sav,sav+k-1,mx);
return 0;
}