Cod sursa(job #1171944)
Utilizator | Moise Alexandru moise_alexandru | Data | 16 aprilie 2014 16:20:23 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>// n(n-1)/2
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[10000];
int f(int a,int b)
{
int s=0;
for(int i=a;i<=b;i++)
s=s+v[i];
return s;
}
int main()
{
int n,a,b;
in>>n;
for(int i=0;i<n;i++)
in>>v[i];
int mx=v[0];
for(int i=0;i<n;i++)
for(int j=i;j<n;j++)
mx=max(mx,f(i,j));
out<<mx;
return 0;
}