Pagini recente » Cod sursa (job #2049795) | Cod sursa (job #530915) | Cod sursa (job #2181515) | Cod sursa (job #2303256) | Cod sursa (job #2175460)
#include <bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,a,sum[6000001],best,inc,sf,id,bestSum=-2147483647;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>a,sum[i]=a+sum[i-1];
int mini=sum[0];
for(int i=1;i<=n;i++)
{
best=sum[i]-mini;
if(bestSum<best)
bestSum=best,inc=id+1,sf=i;
if(mini>sum[i])
mini=sum[i],id=i;
}
g<<bestSum<<" "<<inc<<" "<<sf;
return 0;
}