Cod sursa(job #1916931)
| Utilizator | Data | 9 martie 2017 10:41:29 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n;
fin >> n;
int Si = 0;
int li = 0;
int maxim = 0;
int si = 0;
int fi = 0;
for(int i = 0; i < n; i++)
{
int x;
fin >> x;
Si += x;
if(Si > maxim)
{
maxim = Si;
si = li;
fi = i;
}
if(Si < 0)
{
li = i;
Si = x;
}
}
fout << maxim << ' ' << si + 1<< ' ' << fi + 1;
}
