Cod sursa(job #2466095)
Utilizator | Data | 1 octombrie 2019 15:21:21 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[6000005];
int main()
{
int n,summax=0,ii,jj;
in>>n;
for(int i=1;i<=n;i++)
{
in>>v[i];
v[i]+=v[i-1];
}
for(int i=2;i<=n;i++)
for(int j=1;j<n;j++)
{
int sum=v[i]-v[j];
if(sum>summax)
{
summax=sum;
ii=i;
jj=j;
}
}
out<<summax<<" "<<jj+1<<" "<<ii;
return 0;
}