Cod sursa(job #2128970)
| Utilizator | Data | 12 februarie 2018 12:55:35 | |
|---|---|---|---|
| Problema | Secventa | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n,k,i,v[100],min[100],l,max,j;
ifstream f("secventa.in");
ofstream g("secventa.out");
f>>n>>k;l=1;
for(i=1;i<=n;i++) f>>v[i];
for(i=1;i<=n-k;i++)
{
min[l]=v[i];l++;
for(j=i;j<=i+k;j++)
{
if(v[j]<min[l-1]) {min[l]=v[j];l++;}
}
}
max=min[1];
for(i=1;i<=l;i++) if(max>min[i]) max=min[i];
g<<max;
return 0;
}
