Cod sursa(job #1903194)
Utilizator | Data | 5 martie 2017 00:47:57 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,elmax,prim,ultim,k,v[201];
int main()
{
f>>n>>k;
for(int i=1;i<=n;i++)
{ f>>v[i];
if(v[i]>elmax && i<=n-k+1)
{
elmax=v[i];
prim=i; ultim=i+k-1;
}
}
g<<prim<<' '<<ultim<<' '<<elmax;
f.close();g.close();
return 0;
}