Cod sursa(job #2643016)
| Utilizator | Data | 18 august 2020 13:01:33 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int ii,jj,i,k,j,n,a[6000001],maxx=-6000010,s;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>a[i];
}
for(i=1;i<=n;i++)
{
a[i]=a[i]+a[i-1];
}
for(i=1;i<=n;i++)
{
for(j=1;j<i;j++)
{
s=a[i]-a[j-1];
if(s>maxx){maxx=s;ii=i;jj=j;}
}
}
g<<maxx<<" "<<jj<<" "<<ii;
return 0;
}
