Cod sursa(job #3260148)
| Utilizator | Data | 30 noiembrie 2024 12:26:36 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("ssm.in");
ofstream fo("ssm.out");
int main()
{
int n,s=0,st,dr;
long long v[60000]= {0},smx=-10000;
fi>>n;
for(int i=1; i<=n; i++) fi>>v[i];
for(int i=1; i<=n; i++){
for(int j=n; j>=i; j--){
s=0;
for(int k=i; k<=j; k++) s+=v[k];
if(smx<s)smx=s,st=i,dr=j;
}
}
fo<<smx<<" "<<st<<" "<<dr;
}
