Cod sursa(job #2346436)
Utilizator | Data | 17 februarie 2019 18:06:27 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int main()
{
int n,k,i,v[500001],pozbaza,max=0,min;
f>>n>>k;
for ( i = 1 ; i <= n; i++ )
f>>v[i];
for ( i = 1; i <= n - k + 1; i++ )
if (v[i]>max)
{
max=v[i];
pozbaza=i;
}
g<<pozbaza<<' '<<pozbaza + k - 1<<' '<<max;
return 0;
}