Cod sursa(job #1278475)
| Utilizator | Data | 28 noiembrie 2014 22:25:22 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int a[6000009];
int sum[6000009];
int main()
{
int n,i,s,k,maax=-2000000000,st,dr;
f>>n;
for(i=1;i<=n;i++)
{
f>>a[i];
sum[i]=sum[i-1]+a[i];
}
for(i=1;i<=n;i++)
for(int j=i;j<=n;j++)
{
s=sum[j]-sum[i-1];
if(s>maax)
{
maax=s;
st=i;
dr=j;
}
}
g<<maax<<" "<<st<<" "<<dr;
g<<"\n";
g.close();
return 0;
}
