Cod sursa(job #2557905)
| Utilizator | Data | 26 februarie 2020 09:36:06 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 15 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int v[1005],s[1005],n,i,j,maxim,pozi,pozj;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
s[i]=s[i-1]+v[i];
}
for(i=1;i<n;i++)
{
for(j=i+1;j<=n;j++)
{
if(s[j]-s[i-1]>maxim)
{
maxim=s[j]-s[i-1];
pozi=i;
pozj=j;
}
}
}
g<<maxim<<" "<<pozi<<" "<<pozj;
return 0;
}
