Cod sursa(job #366741)
Utilizator | Andrei Dragus andreidragus | Data | 22 noiembrie 2009 10:32:59 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <stdio.h>
#include<vector>
#include<algorithm>
#include<map>
#define maxn 100020
#define ll long long
using namespace std;
int n;
int k;
int a;
int s;
int m, ans;
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%d", &n);
// scanf("%d", &k);
k=0;
s = 0 ;
s=0;
m = 0;
ans = 0;
for (int i = 0; i < n; i++)
{
scanf("%d", &a);
a -= k;
s+=a;
ans = max(s - m, ans);
m = min(s, m);
}
printf("%d", ans);
return 0;
}