Cod sursa(job #418044)
Utilizator | Lupsan Rares Simion lupsanrares | Data | 15 martie 2010 12:49:08 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a[6000001];
int main ()
{
int n,i,j,k,sc=0,smax=-200000,st,dr;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
{
sc=0;
for(k=i;k<=j;k++)
sc+=a[k];
if(sc>smax)
{
smax=sc;
st=i;
dr=j;
}
}
fout<<smax<<" "<<st<<" "<<dr;
fin.close();
fout.close();
return 0;
}