Cod sursa(job #2757256)
Utilizator | Data | 4 iunie 2021 18:38:12 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 15 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fi("ssm.in");
ofstream fo("ssm.out");
long long smaxi,s,p,k,u,i,n,j,a[6000001];
int main()
{
fi>>n;
for(i=1;i<=n;i++)fi>>a[i];
for(i=1;i<=n;i++)
for(j=i;j<=n;j++)
{
s=0;
for(k=i;k<=j;k++) s=s+a[k];
if(s>smaxi){smaxi=s;p=i;u=j;}
}
fo<<smaxi<<" "<<p<<" "<<u;
fo.close();fi.close();
return 0;
}