Cod sursa(job #3361038)
| Utilizator | Data | 19 iulie 2026 09:39:52 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <climits>
using namespace std;
long long a[6000005];
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
long long N,mx=LLONG_MIN,x=1,y=1,k=1,s=0;
fin>>N;
for(int i=1;i<=N;i++)
fin>>a[i];
for(int i=1;i<=N;i++)
{
s+=a[i];
if(s>mx){mx=s;
x=i;
y=k;
}
if(s<0){s=0;
k=i+1;}
}
fout<<mx<<" "<<y<<" "<<x;
return 0;
}
