Cod sursa(job #3362896)
| Utilizator | Data | 13 august 2026 08:21:54 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int v[6000001];
int s[6000001];
int main()
{
int n,st=0,dr=0,curentst=0,r=-2147000000;
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>v[i];
}
for(int k=1;k<=n;k++)
{
s[k]=s[k-1]+v[k];
}
for(int i=1;i<=n;i++)
{
if(s[i]-s[curentst]>r)
{
r=s[i]-s[curentst];
st=curentst+1;
dr=i;
}
if(s[i]<s[curentst])
{
curentst=i;
}
}
fout<<r<<" "<<st<<" "<<dr;
return 0;
}
