Cod sursa(job #2503986)
Utilizator | Dolteanu Gabriel arcker | Data | 4 decembrie 2019 08:35:26 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n, x;
int bestSum = INT_MIN, sum = 0, st, dr, j;
cin>>n;
for(int i=1;i<=n;++i) {
cin>>x;
if (sum < 0)
sum = x, j = i;
else
sum += x;
if (bestSum < sum)
bestSum = sum, st=j, dr = i;
}
cout<<bestSum<<' '<<st<<' '<<dr;
cin.close(), cout.close();return 0;
}