Pagini recente » Cod sursa (job #3209672) | Cod sursa (job #2750242) | Cod sursa (job #1669016) | Cod sursa (job #886254) | Cod sursa (job #3281406)
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int NMAX=6e6;
int input[NMAX+1];
int sum;
int start;
int main()
{
int n;
int max_sum,best_i=1,best_j=1;
fin>>n;
for(int i=1;i<=n;i++)
fin>>input[i];
sum=input[1];
max_sum=sum;
start=1;
for(int i=2;i<=n;i++)
{
if(sum>=0)
sum=sum+input[i];
else
{
sum=input[i];
start=i;
}
if(sum>max_sum){
max_sum=sum;
best_j=i;
best_i=start;
}
}
fout<<max_sum<<" "<<best_i<<" "<<best_j;
return 0;
}