Cod sursa(job #2878625)
Utilizator | Data | 27 martie 2022 13:34:03 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,x,ic,sf,maxi,s[6000009];
int main()
{
in>>n;
for (int i=1;i<=n;i++)
{
in>>x;
s[i]+=s[i-1]+x;
}
for (int l=1;l<=n;l++)
{
for (int i=1;i<=n-l+1;i++)
{
if (s[i+l-1]-s[i-1]>maxi) maxi=s[i+l-1]-s[i-1],ic=i,sf=i+l-1;
}
}
out<<maxi<<" "<<ic<<" "<<sf;
}