Cod sursa(job #3358085)
| Utilizator | Data | 14 iunie 2026 15:59:19 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
in>>n;
vector <int> a(n+1);
int stf,drf,smax=INT_MIN,s=0,st;
for(int i=1;i<=n;i++)
{
in>>a[i];
s+=a[i];
if(s>smax)
{
stf=st;
drf=i;
smax=s;
}
if(s<0)
{
s=0;
st=i+1;
}
}
out<<smax<<" "<<stf<<" "<<drf;
return 0;
}
