Pagini recente » DeehoroEjkoli | Cod sursa (job #360189) | Cod sursa (job #2531884) | Cod sursa (job #1386720) | Cod sursa (job #2743359)
#include <bits/stdc++.h>
using namespace std;
int main()
{
freopen("ssm.in", "r",stdin);
freopen("ssm.out", "w", stdout);
int n;
cin>>n;
int a[n];
int x = 0,y = 0;
for(int i = 0;i<n;i++)
cin>>a[i];
int maxi = a[0];
int sum = 0;
for(int i = 0;i<n;i++)
{
sum = a[i];
if(sum>maxi)
{
maxi = sum;
x = i;
y = x;
}
for(int j = i+1;j<n;j++)
{
if(j==n)
break;
sum+=a[j];
if(sum>maxi)
{
maxi = sum;
x = i;
y = j;
}
}
}
cout<<maxi<<" "<<x+1<<" "<<y+1;
return 0;
}