Cod sursa(job #3343538)
| Utilizator | Data | 27 februarie 2026 18:25:47 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("ssm.in");
ofstream out ("ssm.out");
int v[6000067];
int main()
{
int n;
in>>n;
int s=-1,i1,i2,mx=INT_MIN,mi1,mi2;
for (int i=1;i<=n;i++)
{
in>>v[i];
if (v[i]>s+v[i])
{
s=v[i];
i1=i;
i2=i;
}
else
{
s+=v[i];
i2=i;
}
if (s>mx)
{
mx=s;
mi1=i1;
mi2=i2;
}
}
out<<mx<<" "<<mi1<<" "<<mi2;
return 0;
}
