Cod sursa(job #2163253)
Utilizator | Data | 12 martie 2018 17:30:12 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int sum,x,n,bestsum,p1,p2,in;
int main(){
f>>n;
for(int i=1; i<=n; ++i){
f>>x;
if(sum<0){
sum=x;
in=i;
}
else
sum=sum+x;
if(sum>bestsum){
bestsum=sum;
p1=in;
p2=i;
}
}
g<<bestsum<<' '<<p1<<' '<<p2<<'\n';
}