Cod sursa(job #3277386)
Utilizator | Data | 15 februarie 2025 21:51:12 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream cin ("ssm.in");
ofstream cout ("ssm.out");
int main()
{
int n;
cin>>n;
int s,v,max1=-2147483647,i1=1,i2,j2;
cin>>v;
s=v;
for (int i=2;i<=n+1;i++)
{
cin>>v;
if (max1<s)
{
max1=s;
i2=i1;
j2=i-1;
}
if (s+v<v)
{
i1=i;
s=v;
}
else
s+=v;
}
cout<<max1<<" "<<i2<<" "<<j2;
return 0;
}