Pagini recente » Cod sursa (job #2368270) | Clasament ath3 | Cod sursa (job #1597063) | Cod sursa (job #2971841) | Cod sursa (job #3198496)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
vector<int> v;
int n,x,S[7000011],poz;
int main() {
fin>>n;
for(int i=0;i<n;i++){
fin>>x;
v.push_back(x);
}
S[0]=v[0];
for(int i=1;i<n;i++){
if(S[i-1]+v[i]>=v[i])
S[i]+=S[i-1]+v[i];
else{
S[i]=v[i-1];
}
}
int max=INT_MIN;
for(int i=0;i<n;i++){
if(max<S[i])
max=S[i];
poz=i;
}
int pozs=poz;
fout<<max<<" ";
while(max!=0){
max-=v[poz];
poz--;
}
fout<<poz+2<<" "<<pozs+1;
return 0;
}
/*
*
*
*/