Pagini recente » Cod sursa (job #414477) | Cod sursa (job #2977520) | Cod sursa (job #2032547) | Cod sursa (job #154245) | Cod sursa (job #3261894)
#include <fstream>
#include <climits>
using namespace std;
const int N = 6e6;
int x[N];
int main()
{
ifstream in("ssm.in");
ofstream out("ssm.out");
int n;
in >> n;
for (int i = 0; i < n; i++)
{
in >> x[i];
}
int ss_max = INT_MIN;
int st_max = 0, dr_max = 0;
for (int st = 0; st < n; st++)
{
///calculam ss_c = v[st]+v[st+1]+...+v[dr]
int ss_c = 0;
for (int dr = st; dr < n; dr++)
{
ss_c += x[dr];
if (ss_c > ss_max)
{
ss_max = ss_c;
st_max = st;
dr_max = dr;
}
}
}
st_max++;
dr_max++;
out << ss_max << " " << st_max << " " << dr_max << "\n";
in.close();
out.close();
return 0;
}