Cod sursa(job #2577006)
| Utilizator | Data | 7 martie 2020 21:58:41 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,i,j,maxi,sum;
int s[6000001],v[6000001];
pair<int,int>la;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
fin>>n;
s[0]=0;
for (i=1;i<=n;i++)
{
fin>>v[i];
s[i]=s[i-1]+v[i];
}
for (i=1;i<=n-1;i++) for (j=i+1;j<=n;j++)
{
sum=s[j]-s[i-1];
if (sum>maxi)
{
maxi=sum;
la.first=i;
la.second=j;
}
}
fout<<maxi<<" "<<la.first<<" "<<la.second;
}
