Cod sursa(job #2972639)
Utilizator | bodnariuc danut danutbod | Data | 29 ianuarie 2023 21:34:28 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include<string.h>
#define NMax 6000003
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long pi,pf,n,i,j,x,semn,maxi,ss,sum,a[NMax];
int main()
{
f>>n;
for (i=1; i<=n; i++)f>>a[i];
maxi=-1000000000000LL;
for (i=1; i<=n; i++){
if(sum>=0)sum+=a[i];
else sum=a[i];
if(maxi<sum){maxi=sum;pf=i;}
}
for(i=pf; i>=1; i--){
ss+=a[i];
if(ss==maxi)pi=i;;
}
g<<maxi<<" "<<pi<<" "<<pf<<'\n';
return 0;
}