In this problem Can you explain me sample test case?How That answer comes.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 151 |
9 | maroonrk | 151 |
In this problem Can you explain me sample test case?How That answer comes.
both code did same.what is the difference?
First one :
set <int> s;
s.insert (1);s.insert (3);s.insert (5);
auto tr = s.lower_bound (2);
s.erase (tr);<-----------here
--------------------------
Second one :
set <int> s;
s.insert (1);s.insert (3);s.insert (5);
auto tr = s.lower_bound (2);
s.erase (*tr);<-----------here
can you share your idea?
i trying to solve this problem.I tried my best I got 23 point(I got 1-st and 2-nd subtask).Can you share your idea for full score?
In this problem.I tried greedy solution.But It didn't pass.I tried but I didn't find anti-test for my solution? Can you give me anti test for this code?
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 5e5 + 5;
ll o, a[N], seg[N], sum;
int main () {
// freopen("input.txt", "r", stdin);
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
o++;
seg[o] = a[1];
for (int i = 2; i <= n; ++i) {
sum = 0;
int r;
for (int j = i; j <= n; ++j) {
sum += a[j];
if (sum >= seg[o]) {
r = j;
break;
}
}
if (sum >= seg[o]) {
o++;
seg[o] = sum;
// i bilen r aralyk
for (int j = i; j <= r; ++j) {
if (seg[o] - a[j] >= seg[o - 1] + a[j]) {
seg[o] -= a[j];
seg[o - 1] += a[j];
}
else break;
}
}
else {
seg[o] += sum;
break;
}
i = r;
}
cout << o << endl;
}
I'm trying to solve this problem about 3 days.Can you share your idea for subtasks.
Will Izho 2024 be offline?
If you has schedule or used to has schedule,Can you share?
In this problem?We should write time complexity O(N log2(N));But i didn't understand solution proof.
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define ppb pop_back
#define sz size()
#define ss second
#define ff first
#define N 200001
using namespace std;
ll _, x, n, a[N];
int main(){
cin >> n;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
vector <ll> v;
v.pb(a[1]);
for(int i = 2; i <= n; i++){
auto t = lower_bound(v.begin(),v.end(),a[i]) - v.begin();
if(t == v.sz) v.pb(a[i]);
else{
v[t] = a[i];
}
}
// for(auto i : v) cout << i << ' ';
cout << v.sz;
}
This code gets accepted.
how to participate info1cup????
my goal is to become master.
link of problem: 104052B - Lunchtime Fruits.i got 70 points but how to get 100 points.I read solution of problem but i didn't understand.Please help this problem to get 100 points
I'm going to participate. I'm interesting about who is going to parcipate?????
that doesn't matter junior
which problems should i solve.or link of questions
what is my wrong in my code. who can find my wrong please say me. [problem:https://codeforces.net/problemset/problem/916/B]. [submission:https://codeforces.net/contest/916/submission/157866266
Name |
---|