Cod sursa(job #3228264)
| Utilizator | Data | 7 mai 2024 10:29:38 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include<fstream>
using namespace std;
ifstream fin("smm.in");
ofstream fout("smm.out");
int n,v[6000000],smx=-1000000,sum,stmax,drmax;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
int sum=0;
int st=0;
for (int dr=1;dr<=n;dr++)
{
sum+=v[dr];
if(sum<0)
{
st=dr+1;
sum=0;
}
if(sum>smx)
{
smx=sum;
stmax=st;
drmax=dr;
}
}
fout<<smx<<' '<<stmax<<' '<<drmax;
}
