Cod sursa(job #1122133)
| Utilizator | Data | 25 februarie 2014 16:31:36 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 15 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int v[1000];
int n, i, j, k;
int sum, S, st, dr;
int main()
{
f>>n;
for (i=1; i<=n; i++)
f>>v[i];
for (i=1; i<=n; i++){
for (j=n; j>=1; j--){
sum = 0;
for (k=i; k<=j; k++)
sum += v[k];
if (sum > S)
{
S = sum;
st = i;
dr = j;
}
}}
g<<S<<" "<<st<<" "<<dr;
}
