Pagini recente » Cod sursa (job #2491593) | Cod sursa (job #2205312) | Cod sursa (job #3250293) | Cod sursa (job #1452109) | Cod sursa (job #2159727)
#include <fstream>
#include <stack>
#include <climits>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
stack <int> s;
int n,k,i,minim1,maxim,P1,P2,minim2,poz1,poz2,v[500010];
int main()
{
f>>n>>k;
for(i=1; i<=n; i++)
f>>v[i];
for(i=1;i<=k;i++)
{
if(v[i]<minim1){minim1=v[i];minim2=INT_MAX;poz1=i;}
else if(v[i]<minim2){minim2=v[i];poz2=i;}
}
maxim=minim1;
for(i=k+1;i<=n;i++)
{
if(v[i]<minim1){minim1=v[i];minim2=INT_MAX;poz1=i;}
else if(v[i]<minim2){minim2=v[i];poz2=i;}
if(poz1==i-k)
{
poz1=poz2;
minim1=minim2;
minim2=INT_MAX;
}
if(minim1>maxim){P2=i;P1=i-k+1;maxim=minim1;}
}
g<<P1<<" "<<P2<<" "<<maxim;
return 0;
}