Cod sursa(job #2158053)
Utilizator | Data | 10 martie 2018 10:05:59 | |
---|---|---|---|
Problema | Secventa | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream c("secventa.in");
ofstream s("secventa.out");
int n,k;
int v[500001];
int i,j;
int nr,ma,in,fin;
int main()
{
c>>n>>k;
for(i=1;i<=n;i++) c>>v[i];
ma=-30001;
for(i=1;i<=n;i++)
{
if(v[i]>ma && i<=n-k+1)
{
int baz=30001;
for(j=i;j<i+k;j++)
if(v[j]<baz) baz=v[j];
if(baz>ma) {ma=baz;in=i;fin=i+k-1;}
baz=30001;
if(i-k>0)
{
for(j=i;j>=i-k;j--)
if(v[j]<baz) baz=v[j];
if(baz>ma) {ma=baz;in=i-k;fin=i;}
}
}
}
s<<in<<" "<<fin<<" "<<ma;
}