Pagini recente » Cod sursa (job #2462543) | Cod sursa (job #1518660) | Borderou de evaluare (job #1036339) | Cod sursa (job #573692) | Cod sursa (job #2157851)
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int x,sum[6000001],best[6000001],n,i1,i2;
int main()
{
f>>n;
for(int i=1; i<=n; i++)
{
f>>x;
sum[i]=sum[i-1]+x;
}
int smax=-INT_MAX;
int mini=0;
for(int i=1; i<=n; i++)
{
best[i]=sum[i]-mini;
if(sum[i]<mini)
{
mini=sum[i];
i1=i+1;
}
if(best[i]>smax)
{
smax=best[i];
i2=i;
}
}
g<<smax<<" "<<i1<<" "<<i2;
return 0;
}