Cod sursa(job #1423865)
Utilizator | Data | 22 aprilie 2015 21:15:23 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,k,p1,v[500009],mx;
int main()
{
ifstream f("secventa.in");
ofstream g("secventa.out");
f>>n>>k;
for (int i=1;i<=n;i++)
f>>v[i];
mx=v[1];
for (int i=2;i<=n-k+1;i++)
{
if(v[i]>mx){mx=v[i];p1=i;}
}
g<<p1<<" "<<p1+k-1<<" "<<mx;
return 0;
}