Pagini recente » Cod sursa (job #2895192) | Cod sursa (job #35487) | Cod sursa (job #1903390) | Cod sursa (job #930174) | Cod sursa (job #1977827)
#include <iostream>
#include <fstream>
#include <limits.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n,i;
f>>n;
int v[n],st=1,dr;
long long minn, maxsum,best;
v[0]=0;
maxsum=INT_MIN;
for(i=1; i<=n; i++)
{f>>v[i]; v[i]=v[i-1]+v[i];}
minn=v[0];
for(i=1; i<=n; i++)
{
best=v[i]-minn;
if(minn>v[i]) {minn=v[i]; st=i+1;}
if(best>maxsum) {maxsum=best; dr=i;}
}
g<<maxsum<<' '<<st<<' '<<dr;
f.close();
g.close();
return 0;
}