Cod sursa(job #3142276)
| Utilizator | Data | 20 iulie 2023 13:48:17 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int N=6000005;
int dp[N];
int a[N];
int n;
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
fin>>a[i];
for(int i=1; i<=n; i++)
{
dp[i]=max(dp[i-1]+a[i], a[i]);
}
int maxi=INT_MIN, l;
for(int i=1; i<=n; i++)
{
if(dp[i]>maxi)
{
maxi=dp[i];
l=i;
}
}
fout<<maxi<<" ";
int s=0;
for(int i=l; i>=1; i--)
{
s+=a[i];
if(s==maxi)
{
fout<<i<<" "<<l;
break;
}
}
return 0;
}
