Cod sursa(job #1650107)
| Utilizator | Data | 11 martie 2016 16:36:33 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
const int NMAX=6000005;
int a[NMAX];
int main()
{
int n,maax=-(1<<30),st=0,dr=0;
f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
long long sum=0;
int j=1;
for(int i=1;i<=n;i++)
{
if(sum<0)
{
j=i;
sum=0;
}
sum+=a[i];
if(sum>maax)
{
maax=sum;
st=j;
dr=i;
}
}
g<<maax<<" "<<st<<" "<<dr<<"\n";
return 0;
}
