Pagini recente » Cod sursa (job #2605816) | Cod sursa (job #2379101) | Cod sursa (job #2439516) | Cod sursa (job #842388) | Cod sursa (job #2913789)
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout ("ssm.out");
const int MAXN = 7000005;
int S[MAXN], X[MAXN], Smax = -7000000, bestST,bestDR;
int main(){
int n;
cin >> n;
for (int i = 1; i <=n;++i)
cin >> X[i];
for (int i = 1; i <=n;++i)
S[i] = S[i-1]+ X[i];
for (int st = 1; st <n;++st)
for (int dr = st +1;dr<=n;++dr){
if (S[dr] - S[st-1] > Smax)
Smax= S[dr] - S[st-1], bestDR = dr, bestST = st;
}
cout << Smax << " " << bestST << " " << bestDR;
}