Nu aveti permisiuni pentru a descarca fisierul grader_test12.in
Cod sursa(job #2342752)
| Utilizator | Data | 13 februarie 2019 12:35:41 | |
|---|---|---|---|
| Problema | Secventa | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
int n,k,ci,mi,maxim=-30001,v[500000],dq[500000];
int main()
{
in>>n>>k;
for(int i=1;i<=n;i++)
in>>v[i];
int st=0,dr=-1;
for(int i=1;i<=n;i++)
{
if(st<=dr&&dq[st]==i-k)
st++;
while(st<=dr&&v[i]<=v[dq[dr]])
dr--;
dq[++dr]=i;
if(v[dq[st]]>maxim)
maxim=v[dq[st]],mi=dq[st];
}
ci=mi;
while(ci+k-1>n&&ci<=mi&&mi<=ci+k-1)
ci--;
out<<ci<<" "<<ci+k-1<<" "<<maxim;
return 0;
}
