Pagini recente » Cod sursa (job #607904) | Cod sursa (job #417338) | Cod sursa (job #3181861) | Cod sursa (job #1473110) | Cod sursa (job #3187333)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int v[1000001], v_suma[1000001], n, suma_max=-1, i_max=-1, j_max=-1;
fin>>n;
for (int i=1; i<=n; i++){
fin>>v[i];
if (i==1)
v_suma[i] = v[i];
else
v_suma[i] = v_suma[i-1] + v[i];
if (v_suma[i] > suma_max){
suma_max = v_suma[i];
i_max = 1;
j_max = i;
//cout<<suma_max<<" "<<i_max<<" "<<j_max<<endl;
} else if (v_suma[i] == suma_max){
if (j_max > i){
suma_max = v_suma[i];
i_max=1;
j_max=i;
}
}
}
for (int num=2; num<=n-1; num++){
for (int i=num+1; i<=n; i++){
if (v_suma[i]-v_suma[num-1] > suma_max){
suma_max = v_suma[i]-v_suma[num-1];
i_max = num;
j_max = i;
//cout<<suma_max<<" "<<i_max<<" "<<j_max<<endl;
} else if (v_suma[i]-v_suma[num-1] == suma_max){
if (i_max > num){
suma_max = v_suma[i]-v_suma[num-1];
i_max = num;
j_max = i;
} else if (i_max == num){
if (j_max-i_max > i-num){
suma_max = v_suma[i]-v_suma[num-1];
i_max=num;
j_max=i;
}
}
}
}
}
fout<<suma_max<<" "<<i_max<<" "<<j_max;
return 0;
}