Cod sursa(job #1957156)
Utilizator | Data | 7 aprilie 2017 13:05:28 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int a,dp[10000],u,sum,stp,drp,n,st,dr,sump;
int main()
{
fin>>n;
for(int i=1;i<n;i++)
{
fin>>a;
if(dp[i-1]>0)
{
dp[i]=a[i]+dp[i-1];
}
if(dp[i]>sum)
{
sum=dp[i];
}
}
fout<<sump<<" "<<stp<<" "<<drp;
return 0;
}