Cod sursa(job #1593040)
Utilizator | Turcas David Emil DologX | Data | 8 februarie 2016 11:29:05 |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,k,v[500001],i,mx=-1,mn,poz1,poz2,j;
int main()
{
ifstream f("secventa.in");
ofstream g("secventa.out");
f>>n>>k;
for(i=1;i<=n;i++) f>>v[i];
for(i=1;i<=n-k+1;i++)
{
mn=9999;
for(j=i;j<=i+k-1;j++)
if(v[i]<mn) mn=v[i];
if(mn>mx) {mx=mn;poz1=i;poz2=i+k-1;}
}
g<<poz1<<" "<<poz2<<" "<<mx;
f.close();
g.close();
return 0;
}