Cod sursa(job #786751)
Utilizator | Data | 11 septembrie 2012 23:36:01 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
int x,n,sum,bestSum=-(1<<30);
int main ()
{ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(int i=1;i<=n;i++)
{f>>x;
if (sum < 0)
sum = x;
else
sum += x;
if (bestSum < sum)
bestSum = sum;
}
g<<bestSum;
f.close(); g.close();
return 0;
}