Cod sursa(job #1938972)
Utilizator | Data | 25 martie 2017 13:01:32 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<iostream>
#include<climits>
using namespace std;
int s[600000];
int main()
{
int n,a,i,x,y;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a;
s[i]=s[i-1]+a;
}
int min1=INT_MAX;
int max1=INT_MIN;
for(i=1;i<=n;i++)
{
if(min1>s[i-1])
{
min1=s[i-1];
x=i;
}
if(s[i]-min1>max1 && i!=1)
{
max1=s[i]-min1;
y=i;
}
}
cout<<max1<<x<<y;
}