Cod sursa(job #3362882)
| Utilizator | Data | 12 august 2026 22:20:53 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int v[6000001];
long long inc[100001];// inc[i]=inc[1]+inc[2]+...+inc[i];
int main()
{
int n,x,a,b,r=1,cnt=0,y,w,d,aux,j,i,k,t,m,c,e,u,p,s2=0,rst=1,rdr=1,st=1,raspmax=0;
int s=0;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>v[i];
if(i==1)
{
raspmax=v[1];
}
s+=v[i];
if(s>raspmax)
{
raspmax=s;
rst=st;
rdr=i;
}
if(s<0)
{
s=0;
st=i+1;
}
}
cout<<raspmax<<" "<<rst<<" "<<rdr;
return 0;
}
