Cod sursa(job #1344730)
Utilizator | Data | 16 februarie 2015 22:36:05 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int i,mx=0,v[100],s=0,n,fi,ok=0,k=0,kmax;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
{
s=s+v[i];
k++;
if(s<0)
{
s=0;
k=0;
}
if(s>mx)
{
mx=s;
fi=i;
kmax=k;
}
}
g<<mx<<" "<<fi-kmax+1<<" "<<fi;
return 0;
}