Cod sursa(job #1042422)
Utilizator | Data | 26 noiembrie 2013 23:58:04 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n, s[6000001], i, j, x, y, mx=-int(2e9);
int main()
{
cin>>n;
for(i=1; i<=n; i++)
{
cin>>s[i];
if(s[i-1]>0) s[i]+=s[i-1];
else
if(s[i-1]<0) j=i;
if(s[i]>mx)
{
mx=s[i];
x=j;
y=i;
}
}
cout<<mx<<" "<<x<<" "<<y;
return 0;
}