Cod sursa(job #2849880)
| Utilizator | Data | 15 februarie 2022 21:33:51 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
#define INF 1000000000
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, x, s, poz, st, dr;
///dp[i].first secv de suma maxima care se termina in i
/// dp[i].second unde incepe exact subsecventa cu suma max
int main()
{
fin>>n;
int maxim=-INF;
for(int i=1; i<=n; i++)
{
fin>>x;
if(s<0)
{
s=x;
poz=i;
}
else
{
s=s+x;
}
if(s>maxim)
{
maxim=s;
st=poz;
dr=i;
}
}
fout<<maxim<<" "<<st<<" "<<dr;
return 0;
}
