Cod sursa(job #2967693)
Utilizator | Data | 19 ianuarie 2023 23:01:35 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
int v[6000005];
int main()
{
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n,a,maxx=0,minn=0,b=1;
cin>>n;
for(int i=1; i<=n; i++)
cin>>a, v[i]=v[i-1]+a;
for(int i=1; i<=n; i++)
{
if(v[i]<minn)
{
minn=v[i];
b=i+1;
}
if(v[i]-minn>maxx)
{
maxx=v[i]-minn;
a=i;
}
}
cout<<maxx<<" "<<b<<" "<<a;
return 0;
}