Pagini recente » Cod sursa (job #2683497) | Cod sursa (job #2100705) | Rating Cristina T (cristom) | Atasamentele paginii luni_ora_10.00 | Cod sursa (job #2981497)
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int NMAX = 6e6 + 1;
int n;
int sir[NMAX];
void readData() {
fin >> n;
for (int i = 1; i <= n; ++i) {
fin >> sir[i];
}
}
void computeMaximalSumSubsequence() {
int sum = 0, maximumSum = 0;
int begin = 0, end = 0;
for (int i = 1; i <= n; ++i) {
for (int j = i; j <= n; ++j) {
int sum = 0;
for (int k = i; k <= j; ++k) {
sum += sir[k];
}
if (sum > maximumSum) {
maximumSum = sum;
begin = i;
end = j;
}
}
}
fout << maximumSum << ' ' << begin << ' ' << end;
}
int main()
{
readData();
computeMaximalSumSubsequence();
return 0;
}