Pagini recente » Cod sursa (job #305475) | Cod sursa (job #2242440) | Cod sursa (job #1228091) | Cod sursa (job #1880223) | Cod sursa (job #2674948)
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int v[10000000];
int sp[10000000];
int main()
{
int n, S, nr, T = 0, sp_i, Sum, max_suma = 0, ind_dreapta, ind_stanga;
fin >> n >> S;
for (int i = 0; i < n; i++)
{
fin >> nr;
T += nr;
sp[i] = T;
v[i] = nr;
}
for (int dreapta = 0; dreapta < n; dreapta++)
{
for (int stanga = 0; stanga <= dreapta; stanga++)
{
Sum = sp[dreapta] - sp[stanga - 1];
if (Sum > max_suma)
{
ind_stanga = stanga + 2;
ind_dreapta = dreapta + 2;
max_suma = Sum;
}
}
}
fout << max_suma << " " << ind_stanga << " " << ind_dreapta;
return 0;
}