Cod sursa(job #2531726)
Utilizator | Maftei Tudor Maftei_Tudor | Data | 26 ianuarie 2020 17:52:04 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n, i, j, si, sj, sm, p1, p2;
int main()
{
fin>>n;
int v[n+1];
for (i=1; i<=n; i++)
fin>>v[i];
for (i=1; i<=n; i++)
{
si=sj=0;
for (j=1; j<=i; j++)
{
si+=v[j];
}
for (j=1; j<i; j++)
{
sj+=v[j];
if (si-sj>sm) {sm=si-sj; p1=j+1; p2=i;}
}
}
fout<<sm<<' '<<p1<<' '<<p2;
return 0;
}