Pagini recente » Istoria paginii runda/vs11_12_vine_oji_2025/clasament | Istoria paginii runda/becreative_1 | Cod sursa (job #211385) | Cod sursa (job #650723) | Cod sursa (job #2193841)
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
const int MAX = 6e6 + 1;
int v[MAX];
int main()
{
int n, s = 0, smax = 0, st, dr, stmax;
cin >> n;
for(int i = 1; i <= n; ++i)
{
cin >> v[i];
s += v[i];
if(s < 0)
{
st = i;
s = 0;
}
if(s > smax)
{
smax = s;
dr = i;
stmax = st + 1;
}
}
cout << smax << " " << stmax << " " << dr;
return 0;
}