Pagini recente » Cod sursa (job #2589772) | Cod sursa (job #1733850) | Cod sursa (job #403907) | Cod sursa (job #3149618) | Cod sursa (job #2816795)
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int v[6000001];
int main()
{
int n;
f >> n;
int sum, smax;
f >> v[0];
sum = v[0];
smax = v[0];
if(n == 1)
{
g << smax << " 1 1\n";
return 0;
}
int ind1 = 1, ind2 = 1;
for(int i = 1; i < n; i++)
{
f >> v[i];
if(sum + v[i] >= v[i])
{
sum += v[i];
}
else
{
sum = v[i];
ind1 = i + 1;
}
if(smax < sum)
{
smax = sum;
ind2 = i + 1;
}
}
g << smax << ' ' << ind1 << ' ' << ind2 << '\n';
f.close();
g.close();
return 0;
}