Cod sursa(job #2472214)
| Utilizator | Data | 12 octombrie 2019 10:32:19 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream f ( "ssm.in" );
ofstream g ( "ssm.out");
int n,v[6000006];
int main()
{ f>>n;
for(int i=1;i<=n;i++) f>>v[i];
ll suma=0,ind=0,l=0,r=0,best=-(1<<30);
for(int i=1;i<=n;i++)
{ if(suma+v[i]>v[i])
suma+=v[i];
else suma=v[i],ind=i;
if(suma>=best)
{ best=suma;
l=ind;
r=i;
}
}
g<<best<< ' '<<l<< ' '<<r;
return 0;
}
