Pagini recente » Cod sursa (job #1908184) | Cod sursa (job #813809) | Cod sursa (job #2552469) | Borderou de evaluare (job #888921) | Cod sursa (job #2682827)
#include <iostream>
#include <fstream>
#define dim 6000005
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int org[dim], copys[dim];
int main()
{
int n,i,j;
in>>n;
for(i=0;i<n;i++)
{
in>>org[i];
}
int maxi=org[0],save = 0,finish = 0;
copys[0] = maxi;
for(j=1;j<n;j++)
{
if(copys[j-1]+org[j]>org[j])
copys[j]=copys[j-1]+org[j];
else
{
copys[j]=org[j];
save=j+1;
}
//cout<<copys[j]<<" ";
if(maxi<copys[j])
{maxi=copys[j];
finish=j+1;}
}
out<<maxi<<" "<<save<<" "<<finish<<endl;
return 0;
}