Cod sursa(job #2849234)
| Utilizator | Data | 14 februarie 2022 18:43:43 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
int n, a[100002];
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
fin >> n;
for(int i = 1 ; i <= n ; ++i)
fin >> a[i];
int s = 0 , d = 1 ,maxi = -2000000010 , sum=a[1] , p = 1;
for(int i=2;i<=n;++i)
{
if(sum < 0) sum=a[i], p = i;
else sum += a[i];
if(sum > maxi)
{
maxi = sum;
s = p;
d = i;
}
}
fout << maxi <<s<<" " << d;
return 0;
}
