Cod sursa(job #2538930)
| Utilizator | Data | 5 februarie 2020 12:54:40 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int i, n, a, j, m1,m2, suma;
long long int s[6000001];
int main()
{
fin>>n;
for(i=1; i<=n; i++)
{
fin>>a;
s[i]=s[i-1]+a;
}
// fout<<endl;
for(i=1; i<n; i++)
{
for(j=i; j<=n; j++)
{
if(suma<s[j]-s[i-1])
{
suma=s[j]-s[i-1];
// fout<<suma<<" ";
m1=i;
m2=j;
}
}
}
fout<<suma<<" "<<m1<<" "<<m2;
return 0;
}
