Pagini recente » Cod sursa (job #205082) | Cod sursa (job #731275) | Cod sursa (job #3030724) | Cod sursa (job #183027) | Cod sursa (job #727719)
Cod sursa(job #727719)
#include<fstream>
using namespace std;
ifstream fi("ssm.in");
ofstream fo("ssm.out");
int bestsum,c,d,a[10000],best[10000],i,N;
int main()
{
fi>>N;
for(i=1;i<=N;i++)
fi>>a[i];
bestsum = a[1];
for (i = 2; i <= N; i++) {
best[i] = a[i];
if (best[i] < best[i-1] + a[i])
{c=i;best[i] = best[i-1] + a[i];}
if (bestsum < best[i])
{d=i;bestsum = best[i];}}
fo<<bestsum<<' '<<c<<' '<<d;
fi.close();
fo.close();
}