목록2009~2014/C/C++ (225)

되는대로 살자

[올림피아드 기출문제&풀이]

#include struct flower { int openmonth; int openday; int closemonth; int closeday; }flower[100000]; int main() { long n; int curmonth=3,curday=1,maxmonth=0,maxday=0,visit[100000],maxpos; int flowercnt=0,i,noflowerchk; scanf("%d",&n); for(i=0;imaxmonth) || (flower[i].closemonth==maxmonth&&flower[i].closeday>=maxday))) { maxmonth=flower[i].closemonth; maxday=flower[i].closeday; maxpos=i; noflowerc..
2009~2014/C/C++ 2011. 12. 12. 17:27
이전 Prev 1 ··· 3 4 5 6 7 8 9 ··· 225 Next 다음