Cod sursa(job #3259080)
| Utilizator | Data | 25 noiembrie 2024 08:36:48 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
long long n,v[60001],m[6001][6001],x,y,maxi=-999999;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
for(int i=1;i<n;i++)
{
for(int j=i;j<=n;j++)
{
m[i][j]=m[i][j-1]+v[j];
if(m[i][j]>maxi)
{
maxi=m[i][j];
x=i;
y=j;
}
}
}
fout<<maxi<<' '<<x<<' '<<y;
return 0;
}
