Cod sursa(job #1735853)
| Utilizator | Data | 31 iulie 2016 12:53:16 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main(){
ifstream in ("ssm.in");
ofstream out ("ssm.out");
int n,v[100000],i, i1, j, j1, s, s_max;
in>>n;
for (i=0; i<n; i++)
in>>v[i];
s_max=v[0];
i1=0; j1=0;
for(i=0;i<n;i++){
s=0;
for(j=i;j<n;j++){
s+=v[j];
if(s>s_max){
s_max=s;
i1=i;
j1=j;
}
}
}
out<<s_max<<" "<<i1+1<<" "<<j1+1;
return 0;
}
