Cod sursa(job #3286275)
Utilizator | Data | 13 martie 2025 21:57:54 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,x,s,p1,p2,j,maxim=INT_MIN;
int32_t main()
{
f>>n;
for(int i=1; i<=n; i++)
{
f>>x;
if(s>=0)
s+=x;
else
s=x, j=i;
if(s>maxim)
maxim=s, p1=j, p2=i;
}
g<<maxim<<' '<<p1<<' '<<p2;
return 0;
}