Cod sursa(job #1903191)
Utilizator | Data | 5 martie 2017 00:46:42 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include <iostream>
using namespace std;
int n,elmax,prim,ultim,k,v[201];
int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++)
{ cin>>v[i];
if(v[i]>elmax && i<=n-k+1)
{
elmax=v[i];
prim=i; ultim=i+k-1;
}
}
cout<<prim<<' '<<ultim<<' '<<elmax;
return 0;
}