#include using namespace std; typedef long long ll; typedef pair pii; int n; stack st; ll heights[100005]; ll leftHei[100005]; ll rightHei[100005]; ll ans = 0; /** 높이에 따라 왼쪽 오른쪽 point를 구하고 계산 **/ int main(){ int n; cin >> n; ll maxSi = 0; for(int i = 0;i > heights[i]; // get Left for(int i = 0;i = heights[i]) st.pop(); leftHei[i] = (st..
#include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef unsigned long ull; typedef pair pii; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; int p; struct Road { int to; int need; }; int visited[55]; int road[55][55]; int added[30]; const int zx3f_ = 1061109567; struct QData { int where; int need; c..
#include int main(){ printf("%10s%10s%10s\n" , "item" , "count" , "price"); printf("%10s%10s%10s\n" , "pen" , "20" , "100"); printf("%10s%10s%10s\n" , "note" , "5" , "95"); printf("%10s%10s%10s\n" , "eraser" , "110" , "97"); }
#include int main(){ std::cout
#include int main(){ std::cout
#include int main(){ std::cout
#include int main(){ std::cout
#include int main(){ std::cout
#include int main(){ std::cout