Pagini recente » Borderou de evaluare (job #969212) | Borderou de evaluare (job #3125773) | Borderou de evaluare (job #508901) | Cod sursa (job #3363680) | Cod sursa (job #3363740)
#include <climits>
#include <fstream>
#include <vector>
using std::vector;
int main() {
std::ifstream in("ssm.in");
std::ofstream out("ssm.out");
int n;
int max = INT_MIN, startMax, endMax;
in >> n;
vector<int> dp(n), idx(n);
in >> dp[0];
for(int i = 1; i < n; i++) {
in >> dp[i];
if(dp[i] >= dp[i - 1] + dp[i]) {
idx[i] = i;
} else {
idx[i] = idx[i - 1];
dp[i] += dp[i - 1];
}
if(dp[i] > max) {
max = dp[i];
startMax = idx[i] + 1;
endMax = i + 1;
}
}
out << max << ' ' << startMax << ' ' << endMax;
in.close();
out.close();
}