Cod sursa(job #556893)
Utilizator | hiticasabel hiticas_abel | Data | 16 martie 2011 12:51:45 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
ifstream f("ssm.in");
ofstream g ("ssm.out");
int i,a[100],k=0;
long n;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
int bessuma=INT_MIN,suma=0,j;
for(i=1;i<=n;i++)
{
suma+=a[i];
if(suma<0)
{suma=0; continue;}
else
if(suma>=bessuma)
{
bessuma=suma;
k++;
}
}
g<<bessuma<<" "<<3<<" "<<3+k;
}