Cod sursa(job #1643567)
Utilizator | Puscasu Razvan Stefan toadehu | Data | 9 martie 2016 19:21:32 |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.83 kb |
#include <fstream>
#include <iostream>
using namespace std;
int main()
{
ifstream fin ("secventa.in");
ofstream fout ("secventa.out");
int n,k;
fin>>n>>k;
int v[n],mn=-30002,mx=-30002;
for (int i=0;i<n;++i)
{
fin>>v[i];
if (i>=k-1 && i<=n-k)
{
mn=v[i];
for (int j=i;j> i-k+1;--j)
{
if (mn>v[j])
{
mn=v[j];
}
if (mx<=mn)
{
mx=mn;
}
}
}
}
for (int i=0;i<n;++i)
{
if (v[i]==mx)
{
fout<<i+1<<" ";
while (v[i]>=mx && i<n)
{
i++;
}
fout<<i<<" "<<mx;
break;
}
}
}