Cod sursa(job #2387297)
| Utilizator | Data | 24 martie 2019 14:50:55 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
const int N=6000005;
int n,v[N];
int main()
{
in>>n;
for(int i=1;i<=n;i++)
in>>v[i];
int suma=-1,best=INT_MIN,stbest=1,drbest=1,st=1;
for(int i=1;i<=n;i++)
{
if(suma<0)
{
suma=v[i];
st=i;
}
else
suma+=v[i];
if(suma>best)
{
best=suma;
stbest=st;
drbest=i;
}
}
out<<best<<' '<<stbest<<' '<<drbest;
return 0;
}
