Cod sursa(job #927078)
Utilizator | Data | 25 martie 2013 16:06:21 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include<fstream>
using namespace std;
int main(){
int n;
ifstream cinr("ssm.in");
ofstream cour("ssm.out");
cinr >> n;
int a[n+1];
for(int i=1; i<=n; i++) cinr >> a[i];
int sum=0, first=0, sec=0, min=0, result=0;
for(int i=1; i<=n; i++){
sum+=a[i];
if(sum>result){
result=sum;
first=min+1;
sec=i;
}
if(sum<0){
sum=0;
min=i;
}
}
cour << result << " " << first << " " << sec;
}