Pagini recente » Cod sursa (job #1303264) | Cod sursa (job #2533012) | Cod sursa (job #1827581) | Cod sursa (job #545035) | Cod sursa (job #1939000)
#include<fstream>
#include <climits>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.in");
int main()
{
int Max=INT_MIN,n,i,f,j;
fin>>n;
int v[n],s[n],m[n];
for (j=1;j<=n;j++) {
fin>>v[j];
s[j]=s[j-1]+v[j];
m[j]=min(m[j-1],s[j]);
if (m[j]==s[j])
i=j;
Max=max(s[j]-m[j-1],Max);
if (Max==s[j]-m[j-1]) {
f=j;
}
}
fout<<Max<<" "<<i<<" "<<f;
/*for (j=1;j<=n,j++) {
s[j]=s[j-1]+v[j];
m[j]=min(m[j-1],s[j]);
Max=max(s[j]-m[j-1],Max);
}*/
return 0;
}