Pagini recente » Cod sursa (job #2773410) | Cod sursa (job #1012101) | Cod sursa (job #2763778) | Cod sursa (job #2661537) | Cod sursa (job #2121422)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
using namespace std;
int best;
struct seq{
int left;
int right;
int sum;
};
int main()
{
int x;
int n,i;
fin >> n;
fin >> x;
seq smax, best;
smax.left = smax.right = 1;
smax.sum = x;
best.left = best.right = 1;
best.sum = x;
for(i=2;i<=n;++i){
fin >> x;
if(x <= x + best.sum)
best.sum += x,
best.right++;
else
best.left = best.right = i,
best.sum = x;
if(smax.sum < best.sum)
smax.sum = best.sum,
smax.left = best.left,
smax.right = best.right;
}
fout << smax.sum <<" "<< smax.left <<" "<< smax.right;
return 0;
}