Pagini recente » Cod sursa (job #1322460) | Cod sursa (job #425806) | Cod sursa (job #2176395) | Clasament preoni62b | Cod sursa (job #903723)
Cod sursa(job #903723)
#include<fstream>
#include<algorithm>
const int NMAX = 6000001;
using namespace std;
int N;
int values[NMAX];
ifstream fin("ssm.in");
ofstream fout("ssm.out");
void solve() {
int start,end, auxStart;
int sum = -int(2e9);
int auxSum = 0;
fin>>N;
int i;
for (i = 0; i < N; i++) {
fin>>values[i];
if (auxSum < 0){
auxSum = values[i]; auxStart = i;
}
else
auxSum += values[i];
if (sum < auxSum) {
sum = auxSum; start = auxStart; end = i;
}
}
fout<<sum<<" "<<start+1<<" "<<end+1<<"\n";
}
int main(){
solve();
return 0;
}