Cod sursa(job #711490)
Utilizator | Data | 12 martie 2012 11:30:58 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
# include <fstream>
using namespace std;
int main(void){
ifstream f("secventa.in");
ofstream f1("secventa.out");
const long DIM=500000;
int n,k,x[DIM],max=0,p1,p2;
f>>n>>k;
for(long i=1;i<=n;i++) f>>x[i];
for(long i=1;i<=n-k+1;i++)
if(x[i]>max){
max=x[i];
p1=i;
p2=i+k-1;
}
f1<<p1<<" "<<p2<<" "<<max;
return 0;
}