Cod sursa(job #2295597)
Utilizator | Data | 3 decembrie 2018 19:41:52 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-32 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
typedef long long ll;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
ll n,sum=0,ans=0;in>>n;
int x1=1,y1=0,x2=1,y2=1;
for(int i=1;i<=n;++i){
ll x;in>>x;
sum+=x;++y1;
if(sum>ans){
ans=sum;
x2=x1;y2=y1;
}
if(sum<0){
x1=i+1;y1=i;
}
}
out<<ans<<" "<<x2<<" "<<y2<<'\n';
return 0;
}