Cod sursa(job #2388223)
Utilizator | Data | 25 martie 2019 19:33:31 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,maxi,mini,x,sum,pi,pf,p;
int main()
{
f>>n;
maxi=-2000000000;mini=0;p=1;
for(i=1;i<=n;i++)
{
f>>x;
sum=sum+x;
if(maxi<sum-mini){ maxi=sum-mini; pi=p; pf=i; }
if(sum<mini){ mini=sum; p=i+1; }
}
g<<maxi<<" "<<pi<<" "<<pf;
return 0;
}