Pagini recente » Cod sursa (job #1543451) | Cod sursa (job #1844492) | Cod sursa (job #3280448) | Cod sursa (job #1754495) | Cod sursa (job #1371859)
#include <fstream>
#include <algorithm>
using namespace std;
ofstream out("ssm.out");
int a[6000002];
int n,i;
int bestSum=-int(2e9);
int best[6000002];
bool ok=false;
int x,sum,y;
bool rezolva_usor=false;
void rezolva1()
{
sum = 0;
bestSum = -9999;
x=1;
int y=n;
for (i = 1; i <= n; i++)
{
sum += a[i];
if (sum < 0)
sum = 0,x=i;
else if (sum > bestSum)
bestSum = sum ,y=i;
}
out<<bestSum<<" "<<x+1<<" "<<y;
}
int main()
{
freopen("ssm.in","r",stdin);
scanf("%d",&n);
for(i=1; i<=n; i++)
{
scanf("%d",&a[i]);
}
rezolva1();
return 0;
}