Pagini recente » Cod sursa (job #3223758) | Borderou de evaluare (job #1034752) | Cod sursa (job #1988119) | Cod sursa (job #1959011) | Cod sursa (job #2805515)
#include <iostream>
using namespace std;
int main(){
int n;
cin>>n;
int a[n+2];
int sol[n+2][n+2];
for(int i=1;i<=n;i++){
cin>>a[i];
sol
}
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;
}
}
}
cout<<max<<" "<<indStart<<" "<<indFinal;
return 0;
}