Cod sursa(job #2372108)
| Utilizator | Data | 6 martie 2019 21:31:21 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, x, y, ind, bestSum=-INT_MAX, s, sum;
//O(1) memorie
int main()
{
fin >> n;
for(int i=1; i<=n; i++)
{
fin >> s;
if(sum<0)
{
sum=s;
ind=i;
}
else
sum+=s;
if(sum>bestSum)
{
bestSum=sum;
y=i;
x=ind;
}
}
fout << bestSum << " " << x << " " << y;
return 0;
}
