Cod sursa(job #663897)
Utilizator | FII-Pintilie Andrei Pintilie_Andrei | Data | 19 ianuarie 2012 09:26:18 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
int a[30001],t[30001];
int main()
{
int n,i,maxim,s,j,st,dr ;
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=-100;
for (i=1; i<=n; i++)
for (j=i; j<=n; j++)
{
s=0;
s=t[j]-t[i-1];
if (s>maxim) { maxim=s; st=i; dr = j;}
}
ofstream fout("ssm.out");
fout<<maxim<<" "<<st<<" "<<dr<<"\n";
fout.close();
return 0;
}