Cod sursa(job #2929026)
Utilizator | Tudor Buhnia tudorbuhnia | Data | 24 octombrie 2022 14:28:39 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
int v[6000005];
int s[6000005];
int main()
{
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n,mx=0,mi,st=1,dr=0;
cin >> n;
for(int i=1;i<=n;i++)
{
cin >> v[i];
}
mi=v[1];
for(int i=1;i<=n;i++)
{
s[i]=s[i-1]+v[i];
//mi=min(mi,s[i]);
if(s[i]<mi)
{
mi=s[i];
st=i;
}
//mx=max(mx,s[i]-mi);
if(s[i]-mi>mx)
{
mx=s[i]-mi;
dr=i;
}
}
cout << mx << " " << st+1 << " " << dr;
return 0;
}