Cod sursa(job #1652845)
| Utilizator | Data | 15 martie 2016 14:55:48 | |
|---|---|---|---|
| Problema | Secventa | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n,i,sum[500001],suma,a[500001],k,maxim,minim,j,start,endd;
int main()
{
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>a[i];
}
for(i=1;i<=n;i++)
{
minim=999999999;
for(j=i;j<=i+k-1;j++)
if(a[j]<minim){
minim=a[j];
// start=j;
//endd=i+k-1;
}
if(minim>maxim){
start=i;
endd=i+k-1;
maxim=minim;
}
}
fout<<start<<" "<<endd<<" "<<maxim;
return 0;
}
