Cod sursa(job #2611989)
| Utilizator | Data | 7 mai 2020 22:35:18 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n, x;
int s[100001], maxim, max1, max2;
int main()
{
cin>>n;
s[0]=0;
for(int i=1; i<=n; i++)
{
cin>>x;
s[i]=s[i-1]+x;
}
for(int i=1; i<=n; i++)
{
for(int j=1; j<=i; j++)
{
if(s[i]-s[j]>maxim)
{
maxim=s[i]-s[j];
max1=j;
max2=i;
}
}
}
cout<<maxim<<" "<<max1+1<<" "<<max2;
return 0;
}
