Cod sursa(job #2869783)
| Utilizator | Data | 11 martie 2022 20:27:00 | |
|---|---|---|---|
| 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;
#define ll long long
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
int n;
in>>n;
ll sum=-1,sumMAX=-LONG_LONG_MAX;
int st=0,dr=0;
int stMAX=0,drMAX=0;
for(int i=1; i<=n; i++)
{
int x;
in>>x;
if(sum<0) sum=x,st=dr=i;
else
{
sum+=x;
dr=i;
}
if(sum>sumMAX) sumMAX=sum,stMAX=st,drMAX=dr;
}
out<<sumMAX<<' '<<stMAX<<' '<<drMAX;
return 0;
}
