Pagini recente » Cod sursa (job #1538570) | Cod sursa (job #2294589) | Cod sursa (job #2626897) | Cod sursa (job #303650) | Cod sursa (job #2849112)
#include <fstream>
using namespace std;
const int N = 6000000;
long long sp[N + 1], maxx;
int main()
{
ifstream in("ssm.in");
ofstream out("ssm.out");
int st_max = 1, dr_max = 1, n, x, suma;
in >> n;
for (int i = 1; i <= n; i++)
{
in >> x;
sp[i] = sp[i - 1] + x;
}
in.close();
for (int st = 1; st <= n; st++)
{
for (int dr = st; dr <= n; dr++)
{
suma = sp[dr] - sp[st - 1];
if (suma > maxx)
{
st_max = st;
dr_max = dr;
maxx = suma;
}
}
}
out << maxx << " " << st_max << " " << dr_max;
out.close();
return 0;
}