Pagini recente » Cod sursa (job #1918245) | Cod sursa (job #269913) | Cod sursa (job #2174886) | Cod sursa (job #916891) | Cod sursa (job #2909258)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
vector<int> v;
int n,a,cur_sum,left=0,right=0,bleft,bright,bsum;
in >> n;
for (int i = 0; i < n; i++)
{
in >> a;
v.push_back(a);
}
bsum = cur_sum = v[0];
while (left < n)
{
right++;
if (right == n)
break;
cur_sum += v[right];
if (cur_sum > bsum)
{
bsum = cur_sum;
bleft = left;
bright = right;
}
if (cur_sum < 0)
{
left = right + 1;
cur_sum = 0;
}
}
out << bsum << " " << bleft +1<< " " << bright+1;
return 0;
}