# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
232379 | 2020-05-16T21:42:59 Z | jam_xd_ | 쌀 창고 (IOI11_ricehub) | C++17 | 0 ms | 0 KB |
#include "ricehub.h" #include "bits/stdc++.h" using namespace std; //si solo era esto me muero >:v. int besthub(int R, int L, int X[], long long B) { /*int rhub = 1,RP;//thub=0; int operaciones = 0, c_hub=0; vector<int>dinamic_multiset; for(int i=0;i<X.size();i++){ if(rhub <= X[i]){ for(int j=X[i];j>=rhub;j++){ operaciones++; if(operaciones >= B){ dinamic_multiset.push_back(c_hub); operaciones=0; c_hub=0; break; } } c_hub++; } if(rhub >= X[i]){ for(int j=X[i];j<=rhub;j++){ operaciones++; if(operaciones>=B){ dinamic_multiset.push_back(c_hub); operaciones = 0; c_hub=0; break; } } c_hub++; } } sort(dinamic_multiset.begin(), dinamic_multiset.end()); cout<<dinamic_multiset[dinamic_multiset.size()-1]; /*bool meh; for(it = dinamic_multiset.begin(),meh!=true;it++) if(it == dinamic_multiset.end()){ RP = (*it); break; } }*/ ///////////////////////////////////////////////////////////////////// /*for(int i=1;i<=L;i++){ }*/ /////////NO FURULA :"V ASI QUE BAMOA HACER DESDE 0 Bv vector<long long>diferencias; int suma_d=0, campos=0; int jamon=0;//auxiliar for(int i=1;i<=L;i++){ for(int j=0;j<X.size();j++){ int dif=0; /*dif = i-X[j]; if(dif <= 0)dif = dif * -1; */ dif = abs(i-X[j]); diferencias.push_back(dif); } for(int k=0;k<X.size();k++){ if(suma_d + V[j] <= B){ suma_d = suma_d + V[j]; campos++; }else{ continue; } } int maximo = max(jamon, campos); jamon = maximo; //comparar anterior y el de ahora //y me quedo con el mayor. } return jamon; }