Pagini recente » simulare-cartita-21 | Istoria paginii runda/jc2019-runda-1/clasament | Clasament tesst | Cod sursa (job #1694884) | Cod sursa (job #2149640)
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
int best = INT_MIN,suma = 0,left = 1,right,n,nr,leftmax;
in>>n;
for(int i = 1; i <= n; i++){
in>>nr;
suma += nr;
if(suma > best || best == -2e9){
right = i;
best = suma;
leftmax = left;
}
if(suma < 0){
suma = 0;
left = i+1;
}
}
out<<best<<" "<<leftmax<<" "<<right;
return 0;
}