Cod sursa(job #2045034)
Utilizator | Data | 21 octombrie 2017 18:37:17 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 25 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,a[6000005],i,j,x,st,dr,k,mn,mx;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>x;
a[i]=a[i-1]+x;
mn=INT_MAX;
for(j=1;j<i;j++)
{
if(a[j]<mn) {mn=a[j];k=j;}
}
if(a[i]-mn>mx) {mx=a[i]-mn;st=k+1;dr=i;}
}
g<<mx<<" "<<st<<" "<<dr;
return 0;
}