Cod sursa(job #1938943)
| Utilizator | Data | 25 martie 2017 12:42:33 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
#include<climits>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int s[6000003];
int main()
{int n,min1=INT_MAX,a,max1=INT_MIN,i,x,y;
fin>>n;
for(i=1;i<=n;i++)
{fin>>a;
s[i]=s[i-1]+a;
}
for(i=1;i<=n;i++)
{if(min1>s[i-1])
{min1=s[i-1];
x=i;
}
if(s[i]-min1>max1)
{max1=s[i]-min1;
y=i;
}
}
fout<<max1<<" "<<x<<" "<<y;
}
