Cod sursa(job #1016786)
Utilizator | Data | 26 octombrie 2013 19:10:39 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <fstream>
using namespace std;
#define inf 1250000000
int main()
{
ifstream cin("secv2.in");ofstream cout("secv2.out");
int v[50005],n=0,k,i;
cin>>n>>k;
v[0]=0;
for(i=1;i<=n;i++)
cin>>v[i],v[i]+=v[i-1];
int minim=0,poz_minim=0,start=0,stop=0,maxim=-inf;
for(i=k;i<=n;i++)
{
if(v[i-k]<minim)
{
minim=v[i-k];
poz_minim=i-k;
}
if((v[i]-minim)>maxim)
{
maxim=v[i]-minim;
start=poz_minim;
stop=i;
}
}
cout<<start+1<<' '<<stop<<' '<<maxim<<'\n';
cin.close();cout.close();return 0;
}