Cod sursa(job #663898)
Utilizator | Dragoslav Elisei elisei | Data | 19 ianuarie 2012 09:26:24 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
using namespace std;
int a[31000], t[31000];
int main()
{
int n,i,j,maxim,ultimul,primul,s;
ifstream fin("ssm.in");
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a[i];
t[i]=t[i-1]+a[i];
}
fin.close();
maxim=a[1];
for(i=1;i<=n;i++)
for(j=i;j<=n;j++)
{
s=t[j]-t[i-1];
if(s>maxim)
{
maxim=s;
ultimul=j;
primul=i;
}
}
ofstream fout("ssm.out");
fout<<maxim<<" "<<primul<<" "<<ultimul<<"\n";
fout.close();
return 0;
}