Cod sursa(job #2965390)
| Utilizator | Data | 15 ianuarie 2023 09:26:45 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define MaxN 6000000
int v[MaxN], s[MaxN];
int main()
{
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,i, max, pozf, pozi, x;
in>>n;
for(i=0; i<n; i++)
in>>v[i];
s[0]=v[0]; max=-MaxN; pozi=0;
for(i=1; i<n; i++)
{
if(s[i-1]>=0) s[i]=s[i-1]+v[i];
else {s[i]=v[i]; x=i;}
if(s[i]>max){ max=s[i]; pozf=i; pozi=x;}
}
out<<max<<" "<<pozi+1<<" "<<pozf+1;
return 0;
}
