Cod sursa(job #2239334)
| Utilizator | Data | 10 septembrie 2018 16:20:12 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
/// TRASH
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int main()
{
int n,v[60006];
f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
int sum = 0;
int sumMax = -33;
for(int i=1;i<=n;i++)
{
for(int j=i+1;j<=n;j++)
{sum=0;
for(int k=i;k<=j;k++)
{
sum+=v[k];
} if(sum > sumMax)
sumMax = sum;
}
}
g<<sumMax;
return 0;
}
