Cod sursa(job #304272)
Utilizator | Bula Ionut cosser | Data | 11 aprilie 2009 20:30:13 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
ifstream f ("ssm.in");
ofstream o ("ssm.out");
int a[100000];
long i, max_cur,max_poz,n,st,fin,nr;
max_cur=max_poz = 0;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
{
if(max_poz + a[i] >= 0)
max_poz=max_poz + a[i];
else max_poz=0,st=i;
if(max_cur<max_poz)
{fin=i; max_cur=max_poz;}
}
for(i=st+1;i<=fin;i++)
o<<a[i]<<" ";
return 0;}