Cod sursa(job #1604894)
| Utilizator | Data | 18 februarie 2016 17:40:48 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
#define L_MAX 10000000
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int v[L_MAX];
int main()
{
long int n, i, smx=-1, pozin, pozfi, y, s;
f>>n;
for(i=1; i<=n; i++)
f>>v[i];
for(i=1; i<n; i++)
{
if(v[i]>=0)
{s=v[i];
for(y=i+1; y<=n; y++)
{
s=s+v[y];
if(smx<=s) {smx=s; pozin=i; pozfi=y;}
}}
}
g<<smx<<" "<<pozin<<" "<<pozfi;
return 0;
}
