Cod sursa(job #211353)
| Utilizator | Data | 1 octombrie 2008 20:37:32 | |
|---|---|---|---|
| Problema | Secventa | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int a[500001],n,lg,bz,poz=0,minn=0;
void citire(){
fin>>n>>lg;
for(int i=0;i<n;i++)
fin>>a[i];
}
void maxim(){
int min1;
for(int i=0;i<=n-lg;i++){
min1=500001;
for(int j=i;j<i+lg;j++)
if(a[j]<min1)
min1=a[j];
if(min1>minn){
minn=min1;
bz=i;
}
}
}
int main(){
citire();
maxim();
fout<<bz+1<<" "<<bz+lg<<" "<<minn<<"\n";
return 0;
}
