Cod sursa(job #1745184)
| Utilizator | Data | 21 august 2016 14:06:12 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
const int NMAX=6000001;
int v[NMAX],sol[NMAX];
int main()
{
int n,x,y;
int i,sum=0;
in>>n;
for(i=1;i<=n;i++)
{
in>>v[i];
sol[i]=max(v[i]+sol[i-1],v[i]);
}
for(i=1;i<=n;i++)
{
if(sol[i]>sum)
{
sum=sol[i];
x=i;
}
}
out<<sum<<" ";
for(i=x;sum>0;i--)
{
sum-=v[i];
}
y=i+1;
out<<y<<" "<<x;
}
