Pagini recente » Cod sursa (job #2377123) | Cod sursa (job #1738076) | Cod sursa (job #3263432) | Cod sursa (job #543269) | Cod sursa (job #3183168)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
long long int n, v[600002], k, suma_max=0;
fin>>n;
for (int i=1; i<=n; i++){
fin>>v[i];
suma_max += v[i];
}
long long int poz1=1, poz2=n, suma=0, poz1max=1, poz2max=n;
for (int i=2; i<=n; i++){
for (int j=i+1; j<=n; j++){
suma = 0;
for (int k=i; k<=j; k++){
suma+=v[k];
}
if (suma >= suma_max){
suma_max = suma;
poz1max = i;
poz2max = j;
}
}
}
fout<<suma_max<<" "<<poz1max<<" "<<poz2max;
return 0;
}