Cod sursa(job #2965964)
| Utilizator | Data | 16 ianuarie 2023 17:07:16 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n;
long long x;
int ind;
int st;
int v[6000001];
long long s=INT_MIN;
long long smax=INT_MIN;
int md;
int sd;
int main()
{
fin>>n;
st=1;
ind=1;
for(int i=1; i<=n; i++)
{
fin>>v[i];
if(s+v[i]>=v[i])
{
s+=v[i];
}
else
{
st=i;
s=v[i];
}
if(s>smax)
{
smax=s;
ind=i;
sd=st;
}
}
fout<<smax<<' '<<sd<<' '<<ind<<'\n';
}
