Cod sursa(job #3231507)
Utilizator | Data | 26 mai 2024 21:48:30 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#define Nmax 6000000
#define ll long long
using namespace std;
fstream f("ssm.in",ios::in);
fstream g("ssm.out",ios::out);
int n,v[Nmax];
int main()
{
int i,ii,p,q,l,lm;
f>>n;
for(i=1;i<=n;i++) f>>v[i];
p=v[1];
q=v[1];
ii=1;
lm=0;
l=0;
for(i=2;i<=n;i++){
if(p<0) p=v[i],l=0;
else p+=v[i],l++;
if(p>q){
lm=l;
ii=i;
q=p;
}
}
g<<q<<' '<<ii-lm<<' '<<ii<<'\n';
return 0;
}