Pagini recente » Cod sursa (job #2291267) | Cod sursa (job #2388025) | Cod sursa (job #821027) | Cod sursa (job #59062) | Cod sursa (job #1588770)
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[6000000],s[6000000];
int main()
{
int i,n,b,a,j,max;
in>>n;
for (i=0; i<n; i++)
in>>v[i];
s[0]=v[0];
max=v[0];
for (i=1; i<n; i++)
if (s[i-1]<0)
{
s[i]=v[i];
}
else s[i]=s[i-1]+v[i];
for (i=0; i<n; i++)
if (s[i]>max)
{
max=s[i];
b=i;
}
for (j=b;j>0;j--)
{
if (s[j]>0) a=j;
}
out<<max<<" "<< a+1<<" "<<b+1;
return 0;
}