Cod sursa(job #1877978)
Utilizator | Data | 13 februarie 2017 20:12:57 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n, a=1, b=1, p=1;
long long s, x, mn, mx;
int main(){
in>>n;
in>>s;
mn=mx=s;
for(int i=2; i<=n; i++){
in>>x;
s+=x;
if(s-mn>mx)mx=s-mn,a=p+1,b=i;
if(s<mn)mn=s,p=i;
}
out<<mx<<" "<<a<<" "<<b;
return 0;
}