Cod sursa(job #2849235)
| Utilizator | Data | 14 februarie 2022 18:44:25 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n, i, x, sum, summax, st, stmax, dr, drmax, j, nrmin, nrpoz;
sum=summax=0;
fin >> n;
int sp[n+1], min_st[n+1], v[i+1];
sp[0]=0;
for(i=1;i<=n;i++){
fin >> v[i];
sp[i]=sp[i-1]+v[i];
j=i-1;
nrmin=INT_MAX;
while(j>0)
{
if(nrmin>v[j]){
nrmin=v[j];
nrpoz=j;
}
j--;
}
min_st[i]=nrpoz;
}
return 0;
}
