Cod sursa(job #2367836)
Utilizator | Data | 5 martie 2019 12:25:20 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int x,n,sum,Max,p,poza,pozb;
int main()
{
f>>n;
f>>x;
Max=x;
sum=x;
p=1;
for(int i=2;i<=n;++i){
f>>x;
if(sum<0){
sum=x;
p=i;
}
else sum+=x;
if(sum>Max){
Max=sum;
poza=p;
pozb=i;
}
}
g<<Max<<" "<<poza<<" "<<pozb;
}