Cod sursa(job #2034027)
Utilizator | Vana Marc VanaMarc | Data | 7 octombrie 2017 13:04:55 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,v[1001],s_max,i_smax,j_smax,sp[1001];
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for( int i=1; i<=n; ++i ){
f>>v[i];
sp[i]=sp[i-1]+v[i];
}
for( int i=1; i<=n; ++i ){
for( int j=i; j<=n; ++j ){
if( s_max<sp[j]-sp[i-1] ){
s_max=sp[j]-sp[i-1];
i_smax=i;
j_smax=j;
}
}
}
g<<s_max<<" "<<i_smax<<" "<<j_smax;
return 0;
}