Cod sursa(job #2562660)
| Utilizator | Data | 29 februarie 2020 16:51:44 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long v[10000005],i,suma=-10000005,x,start,n,maxim=-10000005,st,dr;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
{
if(suma<0)
{
suma=0;
start=i;
}
suma+=v[i];
if(suma>maxim)
{
maxim=suma;
st=start;
dr=i;
}
}
g<<maxim<<" "<<st<<" "<<dr;
return 0;
}
