Cod sursa(job #677092)
Utilizator | Data | 9 februarie 2012 20:58:15 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main ()
{
ifstream f("secventa.in");
ofstream g("secventa.out");
int k,n,max=-32000,v[100],i,j;
f>>n;
f>>k;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=(n-k)+1;i++)
if(v[i]>max)
{max=v[i]; j=i;}
g<<j;
g<<n;
g<<max;
}