Pagini recente » Cod sursa (job #260943) | Cod sursa (job #2795745) | Cod sursa (job #2435588) | Cod sursa (job #1164598) | Cod sursa (job #1245695)
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,a[500001],i,j,x,ms,Max;
int main()
{
f>>n>>k;
Max=-30001; x=0;
ms=30001; // minimul din secventa
for (i=1;i<=n;i++) f>>a[i];
for (i=1;i<=n-k+1;i++)
{
for (j=i;j<=i+k-1;j++)
{
ms=30001;
if (a[j]<ms) ms=a[j];
}
if (ms>Max)
{
Max=ms;
x=i;
}
}
for (j=x+k;j>=x+1;j--) g<<a[j]<<" ";
return 0;
}