Cod sursa(job #1591058)
| Utilizator | Data | 5 februarie 2016 18:59:19 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,m,i,j,x,mx,c1,c2,s,p;
int main()
{
f >> n;
f >> x;
s = x;
mx = x;
c1 = 1;
c2 = 1;
p = 1;
if(s < 0)
s = 0, p = 2;
for(i = 2; i <= n; ++i)
{
f >> x;
s += x;
if(mx < s)
{
mx = s;
c1 = p;
c2 = i;
}
if(s < 0)
{
s = 0;
p = i + 1;
}
}
g << mx << " " << c1 << " " << c2 << '\n';
return 0;
}
