Cod sursa(job #1591053)
Utilizator | Data | 5 februarie 2016 18:53:35 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,m,i,j,x,mx,c1,c2,s[6000001];
int main()
{
f >> n;
for(i = 1; i <= n; ++i)
{
f >> x;
s[i] = x + s[i-1];
}
for(i = 1; i <= n; ++i)
for(j = i+1; j <= n; ++j)
{
if(s[j] - s[i-1] > mx)
{
c1 = i;
c2 = j;
mx = s[j] - s[i-1];
}
}
g << mx << " " << c1 << " " << c2 << '\n';
return 0;
}