Cod sursa(job #2206708)
Utilizator | Data | 23 mai 2018 15:40:00 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#define ll long long
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
int st=0,en=0,pivot=0,sum=0,bestsum=INT_MIN,n,x;
in>>n;
for(int i=0;i<n;i++){
in>>x;
sum+=x;
if(x>sum){
sum=x;
pivot=i;
}
if(sum>bestsum){
st=pivot;
en=i;
bestsum=sum;
}
}
out<<bestsum<<" "<<st+1<<" "<<en+1;
}