Cod sursa(job #1312925)
Utilizator | Data | 10 ianuarie 2015 10:22:19 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int dp[6000003];
int main()
{
int n,i,x;
fin>>n;
dp[1]=x; in=1;
for(int i=2;i<=n;i++)
{ fin>>x;
if(dp[i-1]+x>=x) dp[i]=dp[i-1]+x;
else {dp[i]=x;in=i;}
}
return 0;
}