Cod sursa(job #2480046)
Utilizator | Data | 24 octombrie 2019 20:15:22 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 25 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,i,a,s[10001],j,maxi,imaxi,jmaxi;
int main()
{
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a;
s[i]=s[i-1]+a;
}
for(i=1;i<=n;i++)
{
for(j=i;j<=n;j++)
{
if(maxi<s[j]-s[i-1])
{
maxi=s[j]-s[i-1] ;
imaxi=i;
jmaxi=j;
}
}
}
fout<<maxi<<' '<<imaxi<<' '<<jmaxi;
return 0;
}