Cod sursa(job #744803)
Utilizator | Data | 9 mai 2012 17:55:55 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.63 kb |
# include <fstream>
using namespace std;
int v[500001];
int main(void){
ifstream f("secventa.in");
ofstream f1("secventa.out");
long n,k,i,ok,p,p1,ind,ind2,baza;
f>>n>>k;
for(i=1;i<n;i++) f>>v[i];
baza=-30005;
for(i=1;i<=n-k+1;i++){
ok=1;
p=i;
p1=p;
while(ok)
if(v[i]>v[++p1]) ok=0;
if(v[i]>baza && p1-p>=k-1){
ind=p;
ind2=p1;
baza=v[i];
}
if(v[i]==baza && p==ind && p1<ind2)
ind2=p1;
}
f1<<ind<<" "<<ind2<<" "<<baza;
f.close();
f1.close();
return 0;
}