Cod sursa(job #934950)
Utilizator | Data | 31 martie 2013 23:09:25 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<fstream>
using namespace std;
int main()
{
int v[100],N,K,i,j,k,poz,min,max;
ifstream f("secv.in");
ofstream g("secv.out");
f>>N;
f>>K;
max=-32000;
for(i=1;i<=N;i++)
{
f>>v[i];
}
for(i=1;i<=N;i++)
{ min=32000;
for(j=i;j<=i+K-1;j++)
{
if(v[j]<min) min=v[j];
}
if(min>max) {max=min;poz=i;}
}
g<<poz;
g<<poz+k-1;
g<<max;
}