Cod sursa(job #2905378)
| Utilizator | Data | 21 mai 2022 10:36:36 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int v[6000005];
int main()
{
int n,i,s,st,dr,ans,ans1,maxi=INT_MIN;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
s=0;
st=1;
dr=1;
for(i=1;i<=n;i++)
{
if(s<0)
{
s=v[i];
st=i;
}
else
{
s+=v[i];
}
if(s>maxi)
{
maxi=s;
ans=st;
ans1=i;
}
}
g<<maxi<<" "<<ans<<" "<<ans1;
return 0;
}
