Cod sursa(job #3304959)
| Utilizator | Data | 29 iulie 2025 08:27:42 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int main()
{
int n,i,smax,s,p1,p1f,p2f,nr;
cin>>n;
s=0;
p1=1;
smax=(-1)*(1<<30);
for(i=1;i<=n;i++)
{
cin>>nr;
if(s<0)
{
s=0;
p1=i;
}
s+=nr;
if(s>smax)
{
smax=s;
p1f=p1;
p2f=i;
}
}
cout<<smax<<" "<<p1f<<" "<<p2f;
return 0;
}
