Pagini recente » Cod sursa (job #1163569) | Cod sursa (job #1057441) | Cod sursa (job #2376514) | Cod sursa (job #488645) | Cod sursa (job #2564238)
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int main()
{int max1=-30000,min1,i,aux1,aux2,j,p1,p2,v[500000],k,n;
f>>n>>k;
for(i=1;i<=k;i++)
{f>>v[i];
if(v[i]<min1) min1=v[i];}
if(min1>max1) {max1=min1; p1=1;p2=k;}
for(i=1;i<=n-k;i++)
{p1++;p2++;f>>v[p2];
min1=v[p1];
for(j=p1+1;j<=p2;j++)
if(v[j]<min1) min1=v[j];
if(min1>max1) {max1=min1; aux1=p1;aux2=p2;}
}
g<<p1<<" "<<p2<<" "<<max1;
g.close();
f.close();
return 0;
}