Pagini recente » Cod sursa (job #2463520) | Clasamentul arhivei Infoarena Monthly | Cod sursa (job #1670488) | Cod sursa (job #1921410) | Cod sursa (job #2526771)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int main()
{
int n, v, dp[6000001], m, im=1, ind, f, s, smax;
fin >> n >> v;
dp[1]=v;
smax=v;
ind=1;
f=1;
s=1;
for (int i=2; i<=n; ++i) {
fin >> v;
if (dp[i-1]<0) {
dp[i]=v;
ind=i;
} else {
dp[i]=dp[i-1]+v;
if (smax<dp[i]) {
s=ind;
f=i;
smax=dp[i];
}
}
}
fout << smax << " " << s << " " << f;
return 0;
}