Pagini recente » Cod sursa (job #873731) | Cod sursa (job #1358845) | Cod sursa (job #211680) | Cod sursa (job #802224) | Cod sursa (job #1765868)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
/*int main()
{
int n,i,j,min=0,smax=-2e9,idx,end,begin;
cin>>n;
int s[100];
s[0]=0;
for(i=1;i<=n;i++)
cin>>s[i];
for(i=1;i<=n;i++)
{
s[i]+=s[i-1];
if(smax<s[i]-min)
smax=s[i]-min,begin=idx+1,end=i;
if(s[i]<min)
min=s[i], idx=i;
}
cout<<smax<<"\n"<<begin<<"\n"<<end;
return 0;
}
*/
int main()
{
int n,i,S,sum=0,idx=1,end,begin,smax=-2e9,m,nr=1,sneg;
f>>n>>m;
f>>S;
sum=S;
begin=end=1;
for(i=2;i<=n;i++)
{
f>>S;
nr++;
sneg+=S;
if(sum<0)
sum=S, idx=i;
else
sum+=S;
if(sum>smax)
if(i-idx>=m)
smax=sum, begin=idx,end=i;
}
if(nr==n) cout<<1<<" "<<n<<" "<<sneg;
else
g<<begin<<" "<<end<<" "<<smax;
}