Cod sursa(job #1814805)
| Utilizator | Data | 24 noiembrie 2016 16:19:48 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ssm.in")
ofstream g("ssm.out")
int v[10000];
int main()
{
int i, j, k, n, cs, cf, l=1, s=0, macss=0;
f>>n;
for(i=1; i<=n; i++)
f>>v[i];
for(i=1; i<=n; i++)
{
s=0;
for(j=i+1; j<=n; j++)
{
for(k=i; k<=j; k++)
s=s+v[k];
if(macss<s)
{
macss=s;
cs=j;
cf=k;
}
}
}
g<<macss<<' '<<cs<<' '<<cf;
return 0;
}
