Cod sursa(job #843834)
| Utilizator | Data | 28 decembrie 2012 15:19:52 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include<fstream>
using namespace std;
int a[10001],n,i,ic,pc,sc,max1,sf;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
max1=a[1];
sc=a[1];
ic=1;
sf=1;
pc=1;
for(i=2;i<=n;i++)
{
if(sc>0)
{
sc+=a[i];
}
else
{
sc=a[i];
pc=i;
}
if(sc>max1)
{
ic=pc;
sf=i;
max1=sc;
}
}
/*for(i=ic;i<=sf;i++)
g<<a[i]<<" ";
g<<"\n";*/
g<<max1;
return 0;
}
