Cod sursa(job #1452232)
| Utilizator | Data | 20 iunie 2015 13:38:59 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
int S[6000000];
int main()
{
ifstream in("ssm.in");
ofstream out("ssm.out");
int i, s = 0, n, st, dr, sc, j;
in>>n;
for ( i = 1; i <= n; i++ )
{
in>>S[i];
s = s + S[i];
}
st = 1;
dr = n;
for ( i = 1; i <= n; i++ )
{
sc = 0;
for ( j = i; j <= n; j++ )
{
sc = sc + S[j];
if ( sc > s )
{
s = sc;
st = i;
dr = j;
}
}
}
out<<s<<' '<<st<<' '<<dr;
return 0;
}
