Cod sursa(job #2502346)
| Utilizator | Data | 30 noiembrie 2019 18:19:03 | |
|---|---|---|---|
| Problema | Secventa | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream fin ("secventa.in");
ofstream fout ("secventa.out");
int n,k,v[500000],bmax=-33333,imax,minim;
fin>>n>>k;
for (int i=1;i<=n;i++)
fin>>v[i];
for (int i=k;i<=n;i++)
{
minim=33333;
for (int j=i-k+1;j<=i;j++)
if (v[j]<minim)
minim=v[j];
if (minim>bmax)
{
bmax=minim;
imax=i;
}
}
fout<<imax-k+1<<" "<<imax<<" "<<bmax;
fin.close();
fout.close();
return 0;
}
