Pagini recente » Cod sursa (job #2884259) | Cod sursa (job #2950495) | Cod sursa (job #1138431) | Cod sursa (job #1384741) | Cod sursa (job #2813372)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
vector <int> v;
vector <int> sp;
int main()
{
int n, i, suma_max = (1 << 31), j, suma_min = 0, st, dr;
fin>>n;
v.resize(n+1);
sp.resize(n+1);
for(i = 1; i <= n; i++)
{
fin>>v[i];
}
sp[1] = v[1];
for(i = 2; i <= n; i++)
{
sp[i] = sp[i - 1] + v[i];
}
dr = 1;
st= 1;
for(i = 2; i <= n; i++)
{
if(sp[i] - sp[suma_min] > suma_max)
{
suma_max = sp[i] - sp[suma_min];
dr = i;
st = suma_min + 1;
}
if(sp[i] < sp[suma_min])
{
suma_min = i;
}
}
fout<<suma_max<<" "<<st<<" "<<dr;
return 0;
}