Cod sursa(job #3333895)
| Utilizator | Data | 15 ianuarie 2026 15:36:59 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream cin ("ssm.in");
ofstream cout ("ssm.out");
int v[6000009];
int main()
{
int n, st, dr, maxi=-99999999, s=-1, start;
cin>>n;
for (int i=1; i<=n; i++)
{
cin>>v[i];
}
for (int i=1; i<=n; i++)
{
if (s<0)
{
s=0;
start=i;
}
s+=v[i];
if (s>maxi)
{
maxi=s;
st=start;
dr=i;
}
}
cout<<maxi<<" "<<st<<" "<<dr;
}
