Cod sursa(job #935563)
Utilizator | Demenescu Andrei Deme147 | Data | 3 aprilie 2013 22:31:53 |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<fstream>
using namespace std;
int main()
{
int v[100],N,K,i,j,poz,min,max,poz1;
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;poz1=j;}
}
g<<poz<<" ";
g<<poz1<<" ";
g<<max<<" ";
}