Cod sursa(job #2753808)
| Utilizator | Data | 24 mai 2021 14:33:18 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
long long n,maxim,v[100000],s[10000000],i,j,k,maxim1,maxim2;
int main()
{
cin>>n;
for(i=1; i<=n; i++){
cin>>v[i];
s[i]+=s[i-1]+v[i];
}
for(i=1; i<=n; i++)
for(j=1; j<=i; j++)
if(s[i]-s[j-1]>maxim)
{
maxim=s[i]-s[j-1];
maxim1=j;
maxim2=i;
}
cout <<maxim<<" "<<maxim1<<" "<<maxim2;
return 0;
}
