Pagini recente » Cod sursa (job #1182719) | Cod sursa (job #2874115) | Cod sursa (job #426980) | Cod sursa (job #833469) | Cod sursa (job #3142440)
#include <bits/stdc++.h>
using namespace std;
int n, i, j;
long long a[6000002];
struct posmax {int bgn; int end; long long sum=LONG_LONG_MIN;} maxim;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
in>>n;
for(i=1;i<=n;i++)
{
in>>a[i];
a[i]+=a[i-1];
}
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
if(a[j]-a[i]>maxim.sum)
maxim.sum=a[j]-a[i], maxim.bgn=i, maxim.end=j;
out<<maxim.sum<<" "<<maxim.bgn+1<<" "<<maxim.end;
return 0;
}