#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; typedef vector vi; typedef vector vvi; typedef vector vvvi; typedef vector vvvvi; typedef pair pi; typedef pair ppi; typedef pair pppi; typedef pair ppppi; #define FOR(i,l,r) for(ll i=l;i=l;i--) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define F first #define S second #define BS(A,x) binary_search(ALL(A),x) #define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin()) #define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin()) #define COU(A,x) (UB(A,x)-LB(A,x)) #define sz(c) ((ll)(c).size()) /* #include namespace mp=boost::multiprecision; using Bint=mp::cpp_int; */ templateusing min_priority_queue=priority_queue,greater>; templateostream&operator<<(ostream&os,pair&p){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vector&v){REP(i,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b vm; typedef vector vvm; typedef vector vvvm; typedef vector vvvvm; ostream&operator<<(ostream&os,mint&a){os<>_; vi B(51); B[0]=10; REP(i,25){ B[2*i+1]=3-7*i; B[2*i+2]=17+7*i; } while(_--){ ll N;cin>>N; vi A(N);cin>>A; vvi DP(N+1,vi(N+1,-1e18)); DP[0][0]=0; REP(i,N){ REP(j,i+1){ chmax(DP[i+1][0],DP[i][j]); chmax(DP[i+1][j+1],DP[i][j]-A[i]/10*B[j]); } } ll ans=0; REP(i,N+1)chmax(ans,DP[N][i]); cout<

提出日時	2023/08/30 17:57:24
問題	B: JOI 悪徳商店
ユーザ	TKTYI
言語	C++20 (g++ 12.2.0)
得点
結果	CP