| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1170559 | samia | Bouquet (EGOI24_bouquet) | C++20 | 35 ms | 1980 KiB |
#include <bits/stdc++.h>
using namespace std;
vector<int>v;
int main() {
int n;
cin>>n;
int x,y;
int r=n;
while(r--){
cin>>x>>y;
v.push_back(x);
}
int tab[n];
tab[0]=1;
for(int so=1;so<n;so++){
tab[so]=0;
if(so-v[so]>=0){
tab[so]+=tab[so-v[so]]+1;}
else{tab[so]+=1;}
}
sort(tab,tab+n);
cout<<tab[n-1]<<endl;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
