Pagini recente » Cod sursa (job #2705895) | Cod sursa (job #2977631) | Cod sursa (job #317088) | Cod sursa (job #2928499) | Cod sursa (job #2754139)
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n,maxim=-2147483648,v[6000001],s[6000001],i,j,k,maxim1,maxim2;
int main()
{
cin>>n;
for(i=1; i<=n; i++){
cin>>v[i];
s[i]=s[i-1]+v[i];
}
j=1;
for(i=1; i<=n; i++)
{
if(s[i]-s[j-1]>maxim)
{
maxim=s[i]-s[j-1];
maxim1=j;
maxim2=i;
}
if(s[i]-s[j-1]<0){
j=i+1;
}
}
cout<<maxim<<" "<<maxim1<<" "<<maxim2;
return 0;
}