Pagini recente » Cod sursa (job #1486088) | Cod sursa (job #2327465) | Cod sursa (job #1886118) | Cod sursa (job #2550017) | Cod sursa (job #567432)
Cod sursa(job #567432)
#include <iostream>
#include <fstream>
#include <limits>
using namespace std;
int V[100],S[100],N,i;
int main() {
ifstream fin("ssm.in");
fin>>N;
for (i=1;i<=N;i++)
fin>>S[i];
fin.close();
V[1]=S[1];
for (i=2;i<=N;i++)
V[i]=max(S[i], V[i-1]+S[i]);
int maxim = INT_MIN, suma=0;
int pmax,pmin;
for (i=1;i<=N;i++)
if (V[i]>maxim) {
maxim = V[i];
pmax=i;
}
for (pmin=pmax;;pmin--) {
suma+=S[pmin];
if (suma==maxim)
break;
}
ofstream fout("ssm.out");
fout<<maxim<<' '<<pmin<<' '<<pmax<<endl;
fout.close();
return 0;
}