Pagini recente » Cod sursa (job #1809681) | Cod sursa (job #1954500) | Cod sursa (job #179538) | Cod sursa (job #2746693) | Cod sursa (job #2407647)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int s[6000005], a[6000005];
int main()
{
int i, n, sum=0, x, maxx, j, p, q;
f>>n;
for(i=1; i<=n; i++)
{
f>>x;
a[i]=x;
sum+=x;
s[i]=sum;
}
sum=0;
maxx=-6000000;
for(i=1; i<=n; i++)
for(j=i+1; j<=n; j++)
{
sum=s[j]-s[i-1];
if(sum>maxx) {maxx=sum; p=i; q=j;}
else if(maxx==sum) if(i==p) if(j<q) {q=j;}
}
g<<maxx<<" "<<p<<" "<<q;
return 0;
}