Cod sursa(job #1144062)
Utilizator | Data | 16 martie 2014 15:25:33 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
#define inf (1<<30)
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int sum[6000003];
int main()
{
int n,a,maxim,pozi,pozf;
sum[0]=0;
maxim=-inf;
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>a;
sum[i]=sum[i-1]+a;
}
for(int i=1;i<=n;i++)
for(int j=i;j<=n;j++)
if(maxim<sum[j]-sum[i-1])
{
maxim=sum[j]-sum[i-1];
pozi=i;pozf=j;
}
fout<<maxim<<" "<<pozi<<" "<<pozf;
return 0;
}