UVa11776 - Oh Your Royal Greediness!

简介: UVa11776 - Oh Your Royal Greediness!
importjava.io.BufferedReader;
importjava.io.InputStreamReader;
importjava.io.FileReader;
importjava.io.InputStream;
importjava.io.IOException;
importjava.util.StringTokenizer;
importjava.util.Arrays;
classMain{
publicstaticfinalbooleanDEBUG=false;  
publicNode[] node;
publicintt, n;
classNodeimplementsComparable<Node>    {
intx, y;
booleanok;
publicintcompareTo(Nodeother) 
        {
returnx-other.x;
        }
    }
publicvoidinit(InputStreamin)
    {
Reader.init(in);
t=0;
    }
publicbooleaninput() throwsIOException    {
n=Reader.nextInt();
if (n==-1) returnfalse;
t++;
node=newNode[n];
for (inti=0; i<n; i++) {
node[i] =newNode();
node[i].x=Reader.nextInt();
node[i].y=Reader.nextInt();
node[i].ok=false;
        }
returntrue;
    }
publicvoidsolve()
    {
Arrays.sort(node);
intans=0;
for (inti=0; i<n; i++) {
if (node[i].ok) continue;
ans++;
inty=node[i].y;
for (intj=i+1; j<n; j++) {
if (!node[j].ok&&y<node[j].x) {
node[j].ok=true;
y=node[j].y;
                }
            }
        }
System.out.println("Case "+t+": "+ans);
    }
publicstaticvoidmain(String[] args) throwsIOException    {
Mainsolver=newMain();
solver.init(System.in);
while (solver.input()) {
solver.solve();
        }
    }
}
classReader{
staticBufferedReaderreader;
staticStringTokenizertokenizer;
staticvoidinit(InputStreaminput)
    {
reader=newBufferedReader(newInputStreamReader(input));
tokenizer=newStringTokenizer("");
    }
staticStringnext() throwsIOException    {
while (!tokenizer.hasMoreTokens()) {
tokenizer=newStringTokenizer(reader.readLine());
        }
returntokenizer.nextToken();
    }
staticintnextInt() throwsIOException    {
returnInteger.parseInt(next());
    }
}
目录
相关文章
Uva10001 Garden of Eden
Uva10001 Garden of Eden
41 0
UVa10123 No Tipping
UVa10123 No Tipping
53 0
uva375 Inscribed Circles and Isosceles Triangles
uva375 Inscribed Circles and Isosceles Triangles
36 0
|
算法
UVA题目分类
题目 Volume 0. Getting Started 开始10055 - Hashmat the Brave Warrior 10071 - Back to High School Physics 10300 - Ecological Premium 458 - The Decoder 494...
1556 0
|
存储 固态存储
|
C++
uva 11136 Hoax or what
点击打开链接uva 11136 思路: STL 分析: 1 题目意思比较不好理解,理解了题目之后我们可以利用STL的multiset来做 2 每次找到最大和最小的值,然后求解即可 代码: #include #include #in...
839 0