Cod sursa(job #471632)
| Utilizator | Data | 19 iulie 2010 21:50:16 | |
|---|---|---|---|
| Problema | Secventa | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<fstream>
using namespace std;
int n,k,a[500001];
int main(){
ifstream f("secventa.in");
ofstream g("secventa.out");
f>>n>>k;
int i,max=-30000,st,sp;
for(i=1;i<=n;i++){
f>>a[i];
int min=30000;
if(i>=k){
int j;
for(j=0;j<k;j++){
if(min>a[i-j]){
min=a[i-j];
}
}
if(max<min){
max=min;
st=i-k+1;
sp=i;
}
}
}
g<<st<<" "<<sp<<" "<<max;
return 0;
}
