Cod sursa(job #3335485)
| Utilizator | Data | 22 ianuarie 2026 19:21:17 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 25 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int v[6000001];
int main()
{
int n , i , j , max=0 , imax=0 , jmax=0;
fin>>n;
for(i=1; i<=n; i++)
{
fin>>v[i];
v[i]+=v[i-1];
}
for(j=0; j<=n; j++)
{
for(i=0; i+j<n; i++)
{
if(v[i+j]-v[i]>max)
{
max=v[i+j]-v[i];
imax=i+1;
jmax=i+j;
}
}
}
fout<<max<<" "<<imax<<" "<<jmax;
return 0;
}
