Pagini recente » Cod sursa (job #2265753) | Cod sursa (job #1807654) | Cod sursa (job #1826447) | Cod sursa (job #1600223) | Cod sursa (job #2805622)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main(){
int n;
f>>n;
int a[n+2];
for(int i=1;i<=n;i++){
f>>a[i];
}
int max = -10000000;
int indStart = -1;
int indFinal = -1;
for(int i=1;i<n;i++){
int cont = n;
long long int sPart = a[i];
for(int j=i+1;j<=n;j++){
sPart += a[j];
if(sPart > max){
indStart = i;
indFinal = j;
max = sPart;
}
}
}
g<<max<<" "<<indStart<<" "<<indFinal;
return 0;
}