Cod sursa(job #3316822)
| Utilizator | Data | 21 octombrie 2025 10:57:54 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n,s=0,smax=LLONG_MIN,st=0,dr,temp=0;
fin>>n;
dr=n;
vector<int> v(n+1);
for(int i=0;i<n;++i){
fin>>v[i];
}
for(int i=0;i<n;++i){
s+=v[i];
if(s>smax){
smax=s;
st=temp;
dr=i;
}
if(s<0){
s=0;
temp=i+1;
}
}
fout<<smax<<' '<<st+1<<' '<<dr+1;
return 0;
}
