Cod sursa(job #2065245)
| Utilizator | Data | 13 noiembrie 2017 17:08:09 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
//int v[6000001];
int main()
{
int n, i, x, j, nr=0, maxim=0, S=0, a=1, b=1, poz;
fin >> n;
for(i=1; i<=n; i++)
{
fin >> x;
S=S+x;
//nr++;
if(S<0)
{
S=x;
//nr=0;
poz=i;
}
else
if(S>maxim)
{
maxim=S;
a=poz;
b=i;
//a=i-nr+1;
}
}
fout << maxim << " " << a << " " << b;
return 0;
}
