Pagini recente » Borderou de evaluare (job #3366842) | Borderou de evaluare (job #3365942) | Borderou de evaluare (job #3366837) | Cod sursa (job #3365100) | Cod sursa (job #3366841)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, a;
int dp, dp1;
int CurrentFirst, CurrentLast;
int Max = INT_MIN;
int MaxFirst = 1, MaxLast = 1;
int main() {
fin>>n;
fin>>a;
dp1 = a;
Max = a;
for(int i = 2; i <= n; i++){
fin>>a;
if(a > dp1 + a){
dp = a;
CurrentFirst = i;
CurrentLast = i;
}
else{
dp = dp1 + a;
CurrentLast = i;
}
if(dp > Max){
Max = dp;
MaxFirst = CurrentFirst;
MaxLast = CurrentLast;
}
dp1 = dp;
}
fout<<Max<<" "<<MaxFirst<<" "<<MaxLast;
return 0;
}