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