Cod sursa(job #1877994)
Utilizator | Data | 13 februarie 2017 20:23:29 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
#include <cstdio>
using namespace std;
int n, a=1, b=1, p=1;
long long s, x, mn, mx;
int main(){
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
cin>>n>>s;
mn=mx=s;
for(int i=2; i<=n; i++){
cin>>x, s+=x;
if(s-mn>mx)mx=s-mn,a=p+1,b=i;
if(s<mn)mn=s,p=i;
}
cout<<mx<<" "<<a<<" "<<b;
return 0;
}