Cod sursa(job #1731861)
| Utilizator | Data | 20 iulie 2016 11:12:45 | |
|---|---|---|---|
| Problema | Secventa | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<iostream>
using namespace std;
int n,k,v[101],x,y,z,mini,m;
int minim(int i, int k)
{int mini=v[i];
for(int j=i;j<=i+k-1;j++)if(v[j]<mini)mini=v[j];
return mini;
}
int main()
{cin>>n>>k;
for(int i=1;i<=n;i++)cin>>v[i];
int i=1;
while(i<=n){m=minim(i,k);
if(m>mini){mini=m;
x=i;
y=i+k-1;
}
i++;
}
for(int j=x;j<=y;j++)cout<<v[j]<<" ";
return 0;
}
