Cod sursa(job #2754134)
| Utilizator | Data | 25 mai 2021 11:17:01 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| 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,maxim=-2147483648,v[6000001],s,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];
}
j=1;
for(i=1; i<=n; i++)
{
if(s[i]-s[j]<0){
j=i;
continue;
}
if(s[i]-s[j]>maxim)
{
maxim=s[i]-s[j];
maxim1=j;
maxim2=i;
}
}
cout<<maxim<<" "<<maxim1<<" "<<maxim2;
return 0;
}
