Nu aveti permisiuni pentru a descarca fisierul grader_test2.in
Cod sursa(job #2376283)
Utilizator | Moanta Ionut Liviu Liviu_Ionut_Moanta | Data | 8 martie 2019 14:41:07 |
---|---|---|---|
Problema | Secventa | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 1.23 kb |
#include<fstream>
#include<algorithm>
#include<cstdio>
using namespace std;
///ifstream fin("secventa.in");
///ofstream fout("secventa.out");
FILE *fin=fopen ("secventa.in","r");
FILE *fout=fopen ("secventa.out","w");
int i,u,p,k,n,maxim,pozi,pozf;
int v[500005],d[500005];
int main(){
///fin>>n>>k;
fscanf(fin,"%d%d",&n,&k);
maxim=-30000005;
for(i=1;i<=n;i++){
///fin>>v[i];
fscanf(fin,"%d",&v[i]);
}
p=1;
u=1;
d[1]=1;
for(i=2;i<=n;i++){
while(p<=u&&v[i]<=v[d[u]])
u--;
u++;
d[u]=i;
if(i-d[p]==k)
p++;
if(i>=k){
if(v[d[p]]>maxim){
maxim=v[d[p]];
pozi=i-k+1;
pozf=i;
}
else{
if(v[d[p]]==maxim){
if(i-k+1<pozi){
pozi=d[p];
}
else{
if(i-k+1==pozi){
if(i<pozf)
pozf=i;
}
}
}
}
}
}
fprintf (fout,"%d %d %d",pozi,pozf,maxim);
return 0;
}