Cod sursa(job #948043)
Utilizator | Data | 9 mai 2013 12:14:18 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int i,j,n,v[6000005],w[6000005],I,J,best;
int main()
{
cin>>n;
for (i=1;i<=n;++i)
cin>>v[i];
for (i=1;i<=n;i++)
w[i]=v[i]+w[i-1];
for(i=1;i<=n;++i)
for(j=i;j<=n;++j)
if (best<w[j]-w[i-1])
{
best=w[j]-w[i-1];
I=i;
J=j;
}
cout<<best<<" "<<I<<" "<<J<<'\n';
return 0;
}